순회판매원문제를 위한 분산유전알고리즘 성능평가
Performance Analysis of Distributed Genetic Algorithms for Traveling Salesman Problem
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Distributed genetic algorithm (DGA), also known as island model or coarse-grained model, is a kind of parallel genetic algorithm, in which a population is partitioned into several sub-populations and each of them evolves with its own genetic operators to maintain diversity of individuals. It is known that DGA is superior to conventional genetic algorithm with a single population in terms of solution quality and computation time. Several researches have been conducted to evaluate effects of parameters on GAs, but there is no research work yet that deals with structure of DGA. In this study, we tried to evaluate performance of various genetic algorithms (GAs) for the famous symmetric traveling salesman problems. The considered GAs include a conventional serial GA (SGA) with IGX (Improved Greedy Crossover) and several DGAs with various combinations of crossover operators such as OX (Order Crossover), DPX (Distance Preserving Crossover), GX (Greedy Crossover), and IGX. Two distinct immigration policies, conventional noncompetitive policy and newly proposed competitive policy are also considered. To compare performance of GAs clearly, a series of analysis of variance (ANOVA) is conducted for several scenarios. The experimental results and ANOVAs show that DGAs outperform SGA in terms of computation time, while the solution quality is statistically the same. The most effective crossover operators are revealed as IGX and DPX, especially IGX is outstanding to improve solution quality regardless of type of GAs. In the perspective of immigration policy, the proposed competitive policy is slightly superior to the conventional policy when the problem size is large.
Abstract
Distributed genetic algorithm (DGA), also known as island model or coarse-grained model, is a kind of parallel genetic algorithm, in which a population is partitioned into several sub-populations and each of them evolves with its own genetic operators to maintain diversity of individuals. It is known that DGA is superior to conventional genetic algorithm with a single population in terms of solution quality and computation time. Several researches have been conducted to evaluate effects of parameters on GAs, but there is no research work yet that deals with structure of DGA. In this study, we tried to evaluate performance of various genetic algorithms (GAs) for the famous symmetric traveling salesman problems. The considered GAs include a conventional serial GA (SGA) with IGX (Improved Greedy Crossover) and several DGAs with various combinations of crossover operators such as OX (Order Crossover), DPX (Distance Preserving Crossover), GX (Greedy Crossover), and IGX. Two distinct immigration policies, conventional noncompetitive policy and newly proposed competitive policy are also considered. To compare performance of GAs clearly, a series of analysis of variance (ANOVA) is conducted for several scenarios. The experimental results and ANOVAs show that DGAs outperform SGA in terms of computation time, while the solution quality is statistically the same. The most effective crossover operators are revealed as IGX and DPX, especially IGX is outstanding to improve solution quality regardless of type of GAs. In the perspective of immigration policy, the proposed competitive policy is slightly superior to the conventional policy when the problem size is large.
참고문헌 (24)
- Adamidis, P., "Co-operating populations with different evolution behaviors", Proceedings of IEEE International Conference on Evolutionary Computation, pp.188~191 (1996)
- Ahmed, Z.H., "Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator", International Journal of Biometrics and Bioinformatics, 3(6), pp.96~105 (2010)
- Alba, E., "A survey of parallel distributed genetic algorithms", Complexity, 4(4), pp.31~52 (1999)
- Applegate, D. L., "The traveling salesman problem : a computational study" (2006)
- Belding, T.C., "The distributed genetic algorithm revisited", Proceedings of the Sixth International Conference on Genetic Algorithms, pp.114~121 (1995)
- Cantu-Paz, E., "A survey of parallel genetic algorithms", Calculateurs Paralleles, 10(2), pp.141~171 (1998)
- Freisleben, B., "New genetic local search operators for the traveli", pp.890~899 (1996), Lecture Notes in Computer Science
- Grefenstette, J., "Optimization of control parameters for genetic algorithms", IEEE Transactions on Systems, Man, and Cybernetics, 16(1), pp.122~128 (1986)
- Ismkhan, H., "Developing improved greedy crossover to solve symmetric traveling salesman problem", International Journal of Computer Science Issues, 9(4), pp.121~126 (2012)
- 최재영, "Emergency Vehicle Dispatching on Unreliable Road Networks", 산업경영시스템학회지, 34(3), pp.16~23 (2011), 한국산업경영시스템학회
- 김기태, "순회 판매원 문제를 위한 하이브리드 병렬 유전자 알고리즘", 대한안전경영과학회지, 13(3), pp.107~114 (2011), 대한안전경영과학회
- Kim, Y.K., "Evolutionary algorithms" (2010), Chonnam University
- Kumar, N., "A comparative analysis of PMX, CX and OX crossover operators for solving travelling salesman problem", International Journal of Latest Research in Science and Technology, 1(2), pp.98~101 (2012)
- Laporte, G., "The traveling salesman problem : An overview of exact and approximate algorithms", European Journal of Operational Research, 59(2), pp.231~247 (1992)
- Lutz, M., "Learning python" (2013), O’Reilly Media
- Merz, P., "Memetic algorithms for the traveling salesman problem", Complex Systems, 13, pp.297~345 (1997)
- Noraini, M., "Genetic algorithm performance with different selection strategies in solving TSP", International Conference of Computational Intelligence and Intelligent Systems (2011)
- Park, Y. S., "Distributed genetic algorithms for the TSP", Journal of the Korea Safety Management and Science, 3(3), pp.191~200 (2001)
- Potvin, J. -Y., "Genetic algorithms for the traveling salesman problem", Annals of Operations Research, 63(3), pp.337~370 (1996)
- Rego, C., "Traveling salesman problem heuristics : Leading methods, implementations and latest advances", European Journal of Operational Research, 211(3), pp.427~441 (2011)
- Reinelt, G., "TSPLIB-A traveling salesman problem library", INFORMS Journal on Computing, 3(4), pp.376~384 (1991)
- Starkweather, T., "A comparison of genetic sequencing operators", Proceedings of the fourth International Conference on Genetic Algorithms, pp.69~76 (1991)
- Whitley, D., "A genetic algorithm tutorial", Statistics and Computing, 4(2), pp.65~85 (1994)
- 임동순, "셀룰러 네트워크에서 셀-스위치 할당문제를 위한 유전자 알고리듬", 대한설비관리학회지, 10(1), pp.91~102 (2005), 대한설비관리학회