Chaos Driven Evolutionary Algorithm for the Traveling Salesman Problem

Donald Davendra1∗, Ivan Zelinka1, Roman Senkerik2 and Magdalena Bialic-Davendra3 1Department of Informatics, Faculty of Electrical Engineering and Computing Science, Technical University of Ostrava, Tr. 17. Listopadu 15, Ostrava 2Department of Informatics and Artificial Intelligence, Faculty of Informatics, Tomas Bata University in Zlin, Nad Stranemi 4511, Zlin 76001 3Department of Finance and Accounting, Faculty of Management and Economics, Mostni 5139, Zlin 76001 Czech Republic

[1]  D. Davendra,et al.  Flow Shop Scheduling Using Enhanced Differential Evolution Algorithm , 2007 .

[2]  Ling Wang,et al.  Differential evolution algorithm for hybrid flow-shop scheduling problems , 2011 .

[3]  Godfrey C. Onwubolu,et al.  Emerging optimization techniques in production planning and control , 2002 .

[4]  Godfrey C. Onwubolu,et al.  Scheduling flow shops using differential evolution algorithm , 2006, Eur. J. Oper. Res..

[5]  Godfrey C. Onwubolu,et al.  Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization , 2009 .

[6]  R. Bland,et al.  Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .

[7]  Godfrey C. Onwubolu,et al.  Enhanced differential evolution hybrid scatter search for discrete optimization , 2007, 2007 IEEE Congress on Evolutionary Computation.

[8]  Kenneth V. Price,et al.  An introduction to differential evolution , 1999 .

[9]  Vangelis Th. Paschos,et al.  Applications of combinatorial optimization , 2010 .

[10]  Ivan Zelinka,et al.  Controller Parameters Optimization on a Representative Set of Systems Using Deterministic-Chaotic-Mutation Evolutionary Algorithms , 2010, Evolutionary Algorithms and Chaotic Systems.

[11]  Bernhard Korte,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

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

[13]  M. Hénon,et al.  A two-dimensional mapping with a strange attractor , 1976 .

[14]  Cheng-Yan Kao,et al.  Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..

[15]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[16]  Luigi Fortuna,et al.  Chaotic sequences to improve the performance of evolutionary algorithms , 2003, IEEE Trans. Evol. Comput..

[17]  Vasan Arunachalam,et al.  Optimization Using Differential Evolution , 2008 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[20]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[21]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.