Knowledge-Embedded Multi-Stage Genetic Algorithm for Interactively Optimizing a Large-Scale Distribution Network

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%) accuracy necessary. To realize the above requirements, a knowledge-embedded multi-stage GA method was developed. This method combines a high-speed GA with a knowledge-embedded GA having problem-oriented knowledge effective for some special location patterns. When conventional methods were applied, solutions for more than 20 cases out of 20000 cases were below expert-level accuracy. But the developed method could solve all of 20000 cases at expert-level.

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

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

[3]  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.

[4]  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.

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

[6]  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).