A Multi-world Intelligent Genetic Algorithm to Interactively Optimize Large-scale TSP

To optimize large-scale distribution networks, solving about 1000 middle scale (around 40 cities) TSPs (traveling salesman problems) within an interactive length of time (max. 30 seconds) is required. Yet, expert-level (less than 3% of errors) accuracy is necessary. To realize the above requirements, a multi-world intelligent GA method was developed. This method combines a high-speed GA with an intelligent GA holding problem-oriented knowledge that is effective for some special location patterns. If conventional methods were applied, solutions for more than 20 out of 20,000 cases were below expert-level accuracy. However, the developed method could solve all of 20,000 cases at expert-level

[1]  E. Lawler,et al.  Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1986 .

[2]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[3]  Toshihide Ibaraki,et al.  On metaheuristic algorithms for combinatorial optimization problems , 2001, Systems and Computers in Japan.

[4]  Setsuo Tsuruta,et al.  Traveling salesman problem solving method fit for interactive repetitive simulation of large-scale distribution networks , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[5]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[6]  Martin Grötschel,et al.  Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..

[7]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[8]  Darrell Whitley,et al.  Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .

[9]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[10]  L. Darrell Whitley,et al.  Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.

[11]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[12]  Mauricio G. C. Resende,et al.  A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..

[13]  Setsuo Tsuruta,et al.  A method for solving nested combinatorial optimization problems - a case of optimizing a large-scale distribution network , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[14]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[15]  Erwin Pesch,et al.  Genetic Local Search in Combinatorial Optimization , 1994, Discret. Appl. Math..

[16]  Manuel Iori,et al.  Metaheuristic algorithms for combinatorial optimization problems , 2005, 4OR.

[17]  John N. Hooker,et al.  Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search , 1995, Transp. Sci..