A memetic neural network for the Euclidean traveling salesman problem

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

[2]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[3]  Bruce W. Weide,et al.  Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

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

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[9]  Teuvo Kohonen,et al.  Self-organization and associative memory: 3rd edition , 1989 .

[10]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[11]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

[12]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[13]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[14]  Schloss Birlinghoven.  Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .

[15]  B. Fritzke,et al.  FLEXMAP-a neural network for the traveling salesman problem with linear time and space complexity , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[16]  Laura I. Burke,et al.  The guilty net for the traveling salesman problem , 1992, Comput. Oper. Res..

[17]  Yasuo Matsuyama,et al.  Self-organizing neural networks and various euclidean traveling salesman problems , 1992, Systems and Computers in Japan.

[18]  D. Fogel.  Applying evolutionary programming to selected traveling salesman problems , 1993 .

[19]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[20]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[21]  Bruce L. Golden,et al.  A hierarchical strategy for solving traveling salesman problems using elastic nets , 1995, J. Heuristics.

[22]  Kate Smith-Miles.  An argument for abandoning the travelling salesman problem as a neural-network benchmark , 1996, IEEE Trans. Neural Networks.

[23]  Marco Budinich,et al.  A Self-Organizing Neural Network for the Traveling Salesman Problem That Is Competitive with Simulated Annealing , 1996, Neural Computation.

[24]  K Smith,et al.  An argument for abandoning the travelling salesman problem as a neural-network benchmark. , 1996, IEEE transactions on neural networks.

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

[26]  Takao Enkawa,et al.  A self-organising model for the travelling salesman problem , 1997 .

[27]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[28]  M. Al-Mulhem,et al.  Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part B.

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

[30]  É. Taillard,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[31]  Takao Enkawa,et al.  A self‐organizing neural network approach for multiple traveling salesman and vehicle routing problems , 1999 .

[32]  B. John Oommen,et al.  The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem , 1999, Neural Networks.

[33]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[34]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[35]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[36]  Xiaoyi Gao,et al.  Human population structure detection via multilocus genotype clustering , 2007, BMC Genetics.

[37]  Bernd Freisleben,et al.  Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..

[38]  Kwong-Sak Leung,et al.  An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem , 2003, IEEE Trans. Syst. Man Cybern. Part B.

[39]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[40]  Frederico Carvalho Vieira,et al.  An Efficient Approach to the Travelling Salesman Problem Using Self-Organizing Maps , 2003, Int. J. Neural Syst..

[41]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[42]  E. M. Cochrane,et al.  The co-adaptive neural network approach to the Euclidean Travelling Salesman Problem , 2003, Neural Networks.

[43]  Kwong-Sak Leung,et al.  An expanding self-organizing neural network for the traveling salesman problem , 2004, Neurocomputing.

[44]  Pablo Moscato,et al.  A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem , 2004, J. Heuristics.

[45]  J. Fort.  Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem , 1988, Biological Cybernetics.

[46]  Alexandre Caminada,et al.  Automatic mesh generation for mobile network dimensioning using evolutionary approach , 2005, IEEE Transactions on Evolutionary Computation.

[47]  James Smith,et al.  A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.

[48]  Peter Merz,et al.  Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies , 2006 .

[49]  Abderrafiaa Koukam,et al.  Local search study of honeycomb clustering problem for cellular planning , 2006 .

[50]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[51]  Jean-Charles Créput,et al.  Interactive Meshing for the Design and Optimization of Bus Transportation Networks , 2007 .

[52]  Moritoshi Yasunaga,et al.  Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[53]  A. Koukam,et al.  Transport clustering and routing as a visual meshing process , 2007 .

[54]  A. Koukam,et al.  Self-Organizing Maps in Evolutionary Approach for the Vehicle Routing Problem with Time Windows , 2007 .

[55]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[56]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.