A Multi-world intelligent genetic algorithm to interactively optimize large-scale TSP

Proceedings of the 2006 IEEE International Conference on Information Reuse and Integration, IRI-2006

Volumn , Issue , 2006, Pages 248-255

  Sakurai, Yoshitaka ^a   Onoyama, Takashi ^b   Kubota, Sen ^b   Nakamura, Yoshihiro ^a   Tsuruta, Setsuo ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS; GENETIC ALGORITHMS; KNOWLEDGE BASED SYSTEMS; PATTERN RECOGNITION; TRAVELING SALESMAN PROBLEM;

CONVENTIONAL METHODS; EXPERT-LEVEL ACCURACY; LENGTH OF TIME;

INTELLIGENT SYSTEMS;

EID: 34547396359     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IRI.2006.252421     Document Type: Conference Paper

References (16)

1. Arora, S., "Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems", Journal of the ACM, Vol. 45, No.5, pp.753-782, 1998.
2. Feo T.A.; Recende M. G.C.; and Smith S. H., "A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set", Operations Research, Vol. 42, No.5, pp.860-878, 1994.
3. Grotschel, M.; and Holland, O., "Solution of large-scale symmetric traveling salesman problems", Mathematical Programming, Vol.51, pp.141-202, 1991.
4. Hooker, J.H.; and Natraj, N.R., "Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search", Transportation Science, Vol.29, No.1, pp.30-44, 1995.
5. Ibaraki, T., "Discrete Optimization and Algorithm", Iwanami Syoten,Tokyo, 1993.
6. Kubota S.; Onoyama T.; Onayagi K. and Tsuruta S., "Traveling Salesman Problem Solving Method fit for Interactive Repetitive Simulation of Large-scale Distribution Network", Proc. IEEE SMC'99, pp. 533-538, 1999.
7. Kolen, A.; and Pesch, E., "Genetic Local Search in Combinatorial Optimization", Discrete Applied Mathematics, Vol.48, pp.273-284, 1994.
8. Laporte, G., "The Vehicle Routing Problem: An overview of exact and approximate algorithms", European Journal of Operational Research, Vol.59, pp.345-358, 1992.
9. Lawer, E.; Lenstra, J.; Rinnony, K.; and Shmoys, D., "The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization", John Wiley Sons, 1985.
10. Lin, S.; and Kernighan, B.W., "An effective heuristic algorithm for the traveling salesman problem", Operations Research, Vol. 21, No.2, pp.498-516, 1972.
11. Nagata, Y.; and Kobayashi, S., "The Proposal and Evaluation of a Crossover for Traveling Salesman Problems: Edge Assembly Crossover", Journal of Japan Society for AI, Vol.14, No.5, pp.848-859, 1999.
12. Onoyama, T.; Kubota, S.; Oyanagi, K.; and Tsuruta, S., "A Method for Solving Nested Combinatorial Optimization Problems, Proc. IEEE SMC2000, pp. 340-345, 2000.
13. Whiteley, D.; and Starkweather, T., "Scheduling Problem and Traveling Salesman: The Genetic Edge Recombination Operator", Proceeding of ICGA89, pp.133-140, 1989.
14. Yamamoto, Y.; and Kubo, M., "Invitation to Traveling Salesman Problem, Asakura Syoten, Tokyo, 1997.
15. Yanagiura, M.; and Ibaraki, T., "On Metaheuristic Algorithms for Combinatorial Optimization Problems", Transactions of the IEICE, Vol.J85-D-II, No.8, pp.3-25, 2000.
16. Bertsekas, D. P., "Dynamic Programming: Deterministic and Stochastic Models", Englewood Cliffs, NJ: Prentice-Hall,1987.