• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.1117-1122
• /
• 1993

The environment for surface mounting machines plays an important role in a throughput. An approach to organize the optimal integrated environment for surface mounting machines is presented to increase a throughput. An optimization problem is divided into a feeder setting problem and a task sequencing problem. Two algorithms for each problem are proposed. The feeder setting problems is optimized by an algorithm based on heuristic methods. The task sequencing problem is modeled as a TSP(Traveling salesman problem). An algorithm based on a heuristic tour-to-tour improvement method for TSP is proposed to optimize the task sequencing problem. A simulation is carried out to test developed algorithms.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제1권1호
• /
• pp.6-12
• /
• 2001

Evolutionary algorithms(EAs) have been successfully applied to many combinatorial optimization problems of various engineering fields. Recently, some comparative studies of EAs with other stochastic search algorithms have, however, shown that they are similar to, or even are not comparable to other heuristic search. In this paper, a new hybrid evolutionary algorithm utilizing a new local heuristic search, for combinatorial optimization problems, is presented. The new intelligent local heuristic search is described, and the behavior of the hybrid search algorithm is investigated on two well-known problems: traveling salesman problems (TSPs), and quadratic assignment problems(QAPs). The results indicate that the proposed hybrid is able to produce solutions of high quality compared with some of evolutionary and simulated annealing.

• 한국지능시스템학회논문지
• /
• 제8권5호
• /
• pp.61-71
• /
• 1998

Genetic Algorithm(GA) is a method of approaching optimization problems by modeling and simulating the biological evolution. GA needs large time-consuming, so ti had better do on a parallel computer architecture. Our proposed system has a VLSI-oriented interconnection network, which is constructed from a viewpoint of fractal geometry, so that self-similarity is considered in its configuration. The approach to Parallel Genetic Algorithm(PGA) on our proposed system is explained, and then, we construct the classifier system such that the set of samples is classified into weveral classes based on the features of each sample. In the process of designing the classifier system, We have applied PGA to the Traveling Salesman Problem and classified the sample set in the Euclidean space into several categories with a measure of the distance.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.180.6-180
• /
• 2001

Welding/soldering automation is one of the most important manufacturing issues in order to lower the cost, increase the quality, and avoid labor problems. An off-line programming, OLP, is one of the powerful methods to solve this kind of diver sity problem, Unless an OLP system is ready for the path optimization in welding/soldering, a waste of time and cost is unavoidable due to an inefficient path in welding/soldering processes. Therefore, this study attempts to obtain path optimization using a genetic algorithm based on artificial intelligences. The problem of the welding path optimization is defined as conventional TSP (traveling salesman problem), but still paths have to go through welding lines. An improved genetic algorithm was suggested and the problem was formulated as a TSP problem considering ...

• 한국정밀공학회지
• /
• 제9권3호
• /
• pp.122-131
• /
• 1992

In this paper an approximate solution method for the large-scale Traveling Salesman Problem (TSP) is presented. The method starts with the subdivision of the problem domain into a number of cluster by considering their geometric characteristic. Each cluster has a limited number of nodes so as to get a local solution. They are linked go give the least pathe which covers the whole domain and become TSPs solution with start-and end-node. The approximate local solution in each cluster are obtained based on geometrical properties of the cluster, and combined to give an overall approximate solution for the larte-scale TSP.

• 대한산업공학회지
• /
• 제19권1호
• /
• pp.1-17
• /
• 1993

It is well known that an assembly operation is usually constrained by the geometric interference between parts. These constraints are normally presented as AND/OR precedence relationships. To find a feasible assembly sequence which satisfies the geometric constraints is not an easy task because of the TSP(Traveling Salesman Problem) nature with precedence constraints. In this paper, we developed an automated system based on Neural Network for generating feasible assembly sequences. Modified Hopfield and Tank network is used to solve the problem of AND/OR precedence-constrained assembly sequences. An economic assembly sequence can be also obtained by applying the cost matrix that contains cost-reducing factors. To evaluate the performance and effectiveness of the developed system, a case of automobile generator is tested. The results show that the developed system can provide a "good" planning tool for an assembly planner within a reasonable computation time period.

• 경영과학
• /
• 제3권
• /
• pp.25-36
• /
• 1986

본 연구에서는 리그경기의 요구조건을 분석한 후, 리그경기 일정계획을 위한 모형을 개발하였다. 개발된 모형을 마이크로컴퓨터를 통해 이용자가 사용하기에 간편하도록 구현화했다. 본 연구에서 개발된 리그경기 일정계획 시스템은 각종 리그경기, 특히 연고지를 가진 상업적인 리그경기의 일정계획에 이용될 수 있다. 참가하는 팀들의 요구조건을 적극 반영할 수 있도록 민감도 분석기능을 추가시켰다. 개발된 시스템을 이용할 경우 현재 수작업으로 수행중인 리그경기 일정계획에 많은 도움이 있을 것으로 사료된다. 개발된 시스템에서는 각팀의 이동거리가 비교적 우선순위가 낮은 요구조건으로 분석되었으며 이동거리르 최소화시키는 방법으로 연속 홈경기와 방문경기를 적정수준 이하로 유지시키면서 각팀의 이동거리를 합한 총거리를 최소화하는 방법을 사용했으나 각팀의 실제적인 이동거리가 Critical한 경우에는 Multi-Objective Traveling Salesman기법을 사용하여 향후에 해결이 가능할 것으로 여겨진다.

• 경영과학
• /
• 제13권3호
• /
• pp.187-198
• /
• 1996

The traveling salesman problem has been studied for many years since the model can be used for various applications such as vehicle routing, job sequencing, clustering a data array, and so on. In this paper one of the typical exact algorithms for TSP, Minty's, will be modified to improve the performance of the algorithm on the applications without losing simplicity. The Little's algorithm gives good results, however, the simple and plain Minty's algorithm for solving shortest-route problems has the most intuitive appeal. The suggested Minty's modification is based on the creation of penalty-values on the matrix of a TSP. Computer experiments are made to verify the effectiveness of the modification.

• 산업공학
• /
• 제14권4호
• /
• pp.365-373
• /
• 2001

It is discussed how to determine time windows for pickups and deliveries, which have been assumed to be given in all most of previous studies on traveling salesman problems with time window, vehicle routing problems with time window, vehicle scheduling and dispatching problems, and so on. First, time windows are classified into four models (DR, DA, AR, and AA) by customers‘ polices. For each model, it is shown how a time window is related to various cost terms of suppliers and customers. Under the assumption of collaborative supplier-customer relationship, an integrated cost model for both supplier and customer is constructed for determining boundaries of time windows. The cost models in this paper consists of cost terms that depend on waiting time, early arrival time, late arrival time, and rejection of receipt. A numerical example is provided and results of the sensitivity analysis for some parameters are also provided to help intuitive understanding about the characteristics of the suggested models.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 추계학술발표대회 및 정기총회
• /
• pp.489-492
• /
• 2005

TSP(Traveling Salesman Problem)는 N개의 주어진 도시를 한번씩만 방문하여 다시 출발지로 돌아오는 여러 경로들 중 가장 짧은 거리를 구하는 문제로 유전자 알고리즘이 대표적으로 이용된다. NP-Hard문제로 분류되어 보다 우수한 결과를 얻기 위해 현재까지 다양한 연산자들이 개발되고 연구되어왔다. 본 논문에서는 이러한 연산자들을 적용하여 보다 나은 해를 얻기 위해 새로운 집단초기화 방법과 순차변환 방법을 제안하여 기존의 방법들과 비교를 통해 성능 향상을 입증 하였다.