• 제목/요약/키워드: flexible search algorithm

검색결과 60건 처리시간 0.03초

타부 탐색에 근거한 집락문제의 발견적 해법 (Tabu Search Heuristics for Solving a Class of Clustering Problems)

  • 정주성;염봉진
    • 대한산업공학회지
    • /
    • 제23권3호
    • /
    • pp.451-467
    • /
    • 1997
  • Tabu search (TS) is a useful strategy that has been successfully applied to a number of complex combinatorial optimization problems. By guiding the search using flexible memory processes and accepting disimproved solutions at some iterations, TS helps alleviate the risk of being trapped at a local optimum. In this article, we propose TS-based heuristics for solving a class of clustering problems, and compare the relative performances of the TS-based heuristic and the simulated annealing (SA) algorithm. Computational experiments show that the TS-based heuristic with a long-term memory offers a higher possibility of finding a better solution, while the TS-based heuristic without a long-term memory performs better than the others in terms of the combined measure of solution quality and computing effort required.

  • PDF

비대칭형 다계층 공생 진화알고리듬을 이용한 FMS 공정계획과 일정계획의 통합 (The Integration of FMS Process Planning and Scheduling Using an Asymmetric Multileveled Symbiotic Evolutionary Algorithm)

  • 김여근;김재윤;신경석
    • 대한산업공학회지
    • /
    • 제30권2호
    • /
    • pp.130-145
    • /
    • 2004
  • This paper addresses the integrated problem of process planning and scheduling in FMS (Flexible Manufacturing System). The integration of process planning and scheduling is important for an efficient utilization of manufacturing resources. In this paper, a new method using an artificial intelligent search technique, called asymmetric multileveled symbiotic evolutionary algorithm, is presented to handle the two functions at the same time. Efficient genetic representations and operator schemes are considered. While designing the schemes, we take into account the features specific to each of process planning and scheduling problems. The performance of the proposed algorithm is compared with those of a traditional hierarchical approach and existing evolutionary algorithms. The experimental results show that the proposed algorithm outperforms the compared algorithms.

Optimal Design of a Squeeze Film Damper Using an Enhanced Genetic Algorithm

  • Ahn, Young-Kong;Kim, Young-Chan;Yang, Bo-Suk
    • Journal of Mechanical Science and Technology
    • /
    • 제17권12호
    • /
    • pp.1938-1948
    • /
    • 2003
  • This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.

유전자 알고리듬을 이용한 운행비용 최소화 다용량 차량경로문제 (A Heterogeneous VRP to Minimize the Transportation Costs Using Genetic Algorithm)

  • 임무균;전건욱
    • 산업공학
    • /
    • 제20권2호
    • /
    • pp.103-111
    • /
    • 2007
  • A heterogeneous VRP which considers various capacities, fixed and variable costs was suggested in this study. The transportation cost for vehicle is composed of its fixed and variable costs incurred proportionately to the travel distance. The main objective is to minimize the total sum of transportation costs. A mathematical programming model was suggested for this purpose and it gives an optimal solution by using OPL-STUDIO (ILOG CPLEX). A genetic algorithm which considers improvement of an initial solution, new fitness function with weighted cost and distance rates, and flexible mutation rate for escaping local solution was also suggested. The suggested algorithm was compared with the results of a tabu search and sweeping method by Taillard and Lee, respectively. The suggested algorithm gives better solutions rather than existing algorithms.

선호도 기반 최단경로 탐색을 위한 휴리스틱 융합 알고리즘 (A Combined Heuristic Algorithm for Preference-based Shortest Path Search)

  • 옥승호;안진호;강성호;문병인
    • 대한전자공학회논문지TC
    • /
    • 제47권8호
    • /
    • pp.74-84
    • /
    • 2010
  • 본 논문에서는 개미 군집 최적화 (Ant Colony Optimization; ACO) 및 A* 휴리스틱 알고리즘이 융합된 선호도 기반 경로탐색 알고리즘을 제안한다. 최근 ITS (Intelligent Transportation Systems)의 개발과 함께 차량용 내비게이션의 사용이 증가하면서 경로탐색 알고리즘의 중요성이 더욱 높아지고 있다. 기존의 Dijkstra 및 A*와 같은 대부분의 최단경로 탐색 알고리즘은 최단거리 또는 최단시간 경로 탐색을 목표로 한다. 하지만 이러한 경로 탐색 결과는 더 안전하고 특정 경로를 선호하는 운전자를 위한 최적의 경로가 아니다. 따라서 본 논문에서는 선호도 기반 최단 경로 탐색 알고리즘을 제안한다. 제안된 알고리즘은 주어진 맵의 링크 속성 정보를 이용하며, 각 링크에 대한 사용자 선호도는 내비게이션 사용자에 의해 설정되어 진다. 제안된 알고리즘은 C로 구현하였으며, 64노드 및 118링크로 구성된 맵에서 다양한 파라미터를 통해 성능을 측정한 결과 본 논문에서 제안한 휴리스틱 융합 알고리즘은 선호도 기반 경로뿐만 아니라 최단 경로 탐색에도 적합함을 알 수 있었다.

Segmentation Algorithm for Wafer ID using Active Multiple Templates Model

  • Ahn, In-Mo;Kang, Dong-Joong;Chung, Yoon-Tack
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.839-844
    • /
    • 2003
  • This paper presents a method to segment wafer ID marks on poor quality images under uncontrolled lighting conditions of the semiconductor process. The active multiple templates matching method is suggested to search ID areas on wafers and segment them into meaningful regions and it would have been impossible to recognize characters using general OCR algorithms. This active template model is designed by applying a snake model that is used for active contour tracking. Active multiple template model searches character areas and segments them into single characters optimally, tracking each character that can vary in a flexible manner according to string configurations. Applying active multiple templates, the optimization of the snake energy is done using Greedy algorithm, to maximize its efficiency by automatically controlling each template gap. These vary according to the configuration of character string. Experimental results using wafer images from real FA environment are presented.

  • PDF

유연복합재를 이용한 헬리콥터 꼬리날개 구동축의 최적 설계 (Optimum Design of a Helicopter Tailrotor Driveshaft Using Flexible Matrix Composite)

  • 신응수;홍을표;이기녕;김옥현
    • 대한기계학회논문집A
    • /
    • 제28권12호
    • /
    • pp.1914-1922
    • /
    • 2004
  • This paper provides a comprehensive study of optimum design of a helicopter tailrotor driveshaft made of the flexible matrix composites (FMCs). Since the driveshaft transmits power while subjected to large bending deformation due to aerodynamic loadings, the FMCs can be ideal for enhancing the drivetrain performance by absorbing the lateral deformation without shaft segmentation. However, the increased lateral flexibility and high internal damping of the FMCs may induce whirling instability at supercritical operating conditions. Thus, the purpose of optimization in this paper is to find a set of tailored FMC parameters that compromise between the lateral flexibility and the whirling stability while satisfying several criteria such as torsional buckling safety and the maximum shaft temperature at steadystate conditions. At first, the drivetrain was modeled based on the finite element method and the classical laminate theory with complex modulus approach. Then, an objective function was defined as a combination of an allowable bending deformation and external damping and a genetic algorithm was applied to search for an optimum set with respect to ply angles and stack sequences. Results show that an optimum laminate consists of two groups of layers: (i) one has ply angles well below 45$^{\circ}$ and the other far above 45$^{\circ}$ and (ii) the number of layers with low ply angles is much bigger than that with high ply angles. It is also found that a thick FMC shaft is desirable for both lateral flexibility and whirling stability. The genetic algorithm was effective in converging to several local optimums, whose laminates exhibit similar patterns as mentioned above.

전장환경에서 무인전투차량의 경로계획 알고리즘설정 영향요인 분석 (An Analysis on the Influential Factors to Set the Path Planning Algorithm for Unmanned Ground Vehicle in Combat Environment)

  • 백종성;이춘주
    • 로봇학회논문지
    • /
    • 제4권3호
    • /
    • pp.233-242
    • /
    • 2009
  • This paper briefly reviews the path planning methods that are applicable to the autonomous mobile robots for the military. Two distinct path search algorithms, $A^*$ and $D^*$ that are most popular and flexible in public applications, among those reviewed are coded and analyzed in terms of combat environment assessment factors called METT+TC for the area of operations. The results imply that it is important to consider the characteristics of defense acquisition process and the specific requirements of defense operation so that the successful technology development of the Robot products is directly linked to the defense procurement of Robot products.

  • PDF

점진적 최적화 기법에서 불규칙 삼각망을 이용한 평면구조의 응력경로 탐색모델의 개발 (Development of a Stress Path Search Model of Evolutionary Structural Optimization Using TIN)

  • 김남수;이정재;윤성수;김윤순
    • 한국농공학회논문집
    • /
    • 제46권4호
    • /
    • pp.65-71
    • /
    • 2004
  • Stress Path Search Model of Evolutionary Structural Successive Optimization (SPSMESO) using Triangular Irregular Network(TIN) was developed for improving over burden at initial design of ESO and strict stress direction of strut-and-tie model and truss model. TIN was applied for discretizing structures in flexible stress path and segments of TIN was analyzed as one-dimensional line element for calculating stress. Finally, stress path was searched using ESO algorithm. SPSMESO was efficient to express the direction of stress for 2D structure and time saving.

DYNAMIC ROUTE PLANNING BY Q-LEARNING -Cellular Automation Based Simulator and Control

  • 사노 마사키;정시
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.24.2-24
    • /
    • 2001
  • In this paper, the authors present a row dynamic route planning by Q-learning. The proposed algorithm is executed in a cellular automation based traffic simulator, which is also newly created. In Vehicle Information and Communication System(VICS), which is an active field of Intelligent Transport System(ITS), information of traffic congestion is sent to each vehicle at real time. However, a centralized navigation system is not realistic to guide millions of vehicles in a megalopolis. Autonomous distributed systems should be more flexible and scalable, and also have a chance to focus on each vehicles demand. In such systems, each vehicle can search an own optimal route. We employ Q-learning of the reinforcement learning method to search an optimal or sub-optimal route, in which route drivers can avoid traffic congestions. We find some applications of the reinforcement learning in the "static" environment, but there are ...

  • PDF