A memetic neural network for the Euclidean traveling salesman problem

Neurocomputing

Volumn 72, Issue 4-6, 2009, Pages 1250-1264

  Créput, Jean Charles ^a   Koukam, Abderrafiãa ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE BELFORT MONTBÉLIARD   (France)

Author keywords

Euclidean traveling salesman problem; Evolutionary algorithm; Memetic algorithm; Neural network; Self organizing map

Indexed keywords

CLOSEST POINTS; COMPUTATION TIMES; EUCLIDEAN TRAVELING SALESMAN PROBLEM; EVOLUTIONARY DYNAMICS; FITNESS EVALUATIONS; MAPPING OPERATORS; MEMETIC; MEMETIC ALGORITHM; SELECTION OPERATORS; SELF-ORGANIZING MAP; SOLUTION QUALITIES; TEST PROBLEMS;

CONFORMAL MAPPING; EVOLUTIONARY ALGORITHMS; NEURAL NETWORKS; PROBLEM SOLVING; STRENGTH OF MATERIALS;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; COMPUTER ANALYSIS; CONTROLLED STUDY; DYNAMICS; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL PARAMETERS; MOLECULAR EVOLUTION; PRIORITY JOURNAL; QUALITY CONTROL; SAMPLE SIZE; STANDARDIZATION;

EID: 58149478365     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2008.01.023     Document Type: Article

References (48)

1. Al-Mulhem H., and Al-Maghrabi T. Efficient convex-classic net algorithm to solve the Euclidean traveling salesman problem. IEEE Trans. Syst. Man Cybernet. 28 (1998) 618-620
2. Angéniol B., de La Croix Vaubois G., and Le Texier J.Y. Self-organizing feature maps and the travelling salesman problem. Neural Network 1 (1988) 289-293
3. Aras N., Oommen B.J., and Altinel I.K. The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem. Neural Networks 12 9 (1999) 1273-1284
4. Arora S. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J. ACM 45 5 (1998) 753-782
5. T. Bäck, F. Hoffmeister, H.P. Schwefel, A survey of evolution strategies, In: Fourth International Conference on Genetic Algorithms, La Jolla, CA, 1991.
6. Bentley J.L., Weide B.W., and Yao A.C. Optimal expected time algorithms for closest point problems. ACM Trans. Math. Software 6 4 (1980) 563-580
7. Boese K.D., Kahng A.B., and Muddu S. Adaptive multi-start technique for combinatorial global optimization. J. Oper. Res. Lett. 16 (1994) 101-113
8. Budinich M. A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Comput. 8 (1996) 416-424
9. Burke L.I., and Damany P. The guilty net for the traveling salesman problem. Comput. Oper. Res. 19 4 (1992) 255-265
10. Buriol L., França P.M., and Moscato P. A new memetic algorithm for the asymmetric traveling salesman problem. J. Heuristics 10 5 (2004) 483-506
11. Cochrane E.M., and Beasley J.E. The co-adaptive neural network approach to the Euclidean travelling salesman problem. Neural Networks 16 (2003) 1499-1525
12. Créput J.C., Koukam A., and Hajjam A. Self-organizing maps in evolutionary approach for the vehicle routing problem with time windows. Int. J. Comput. Sci. Network Security 7 1 (2007) 103-110
13. Créput J.C., and Koukam A. Interactive meshing for the design and optimization of bus transportation networks. J. Transport. Eng. 133 9 (2007) 529-538
14. Créput J.C., and Koukam A. Transport clustering and routing as a visual meshing process. J. Inform. Optimiz. Sci. 28 4 (2007) 573-601
15. Créput J.C., Koukam A., Lissajoux T., and Caminada A. Automatic mesh generation for mobile network dimensioning using evolutionary approach. IEEE Trans. Evolut. Comput. 9 1 (2005) 18-30
16. Créput J.C., and Koukam A. Local search study of honeycomb clustering problem for cellular planning. Int. J. Mobile Network Design Innov. 1 2 (2006) 153-160
17. J.J. Dongarra, Performance of various computers using standard linear equations software, Technical Report CS-89-85, Department of Computer Science, University of Tennessee, USA, available at 〈http://www.netlib.org/benchmark/performance.ps〉, 2006.
18. Durbin R., and Willshaw D.J. An analogue approach to the traveling salesman problem using an elastic net method. Nature 326 (1987) 689-691
19. Fogel D.B. Applying evolutionary programming to selected traveling salesman problems. Cybernet. Syst. 24 (1993) 27-36
20. Fort J.C. Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem. Biol. Cybernet. 59 (1988) 33-40
21. B. Fritzke, P. Wilke, FLEXMAP: A neural network for the traveling salesman problem with linear time and space complexity, in: Proceedings of the International Joint Conference on Neural Networks, IEEE, Piscataway, 1991, pp. 929-934.
22. Gambardella L.M., Taillard E., and Agazzi G. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D., Dorigo M., and Glover F. (Eds). New Ideas in Optimization (1999), McGraw-Hill, UK 63-76
23. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Learning (1994), Addison-Wesley, New York
24. Helsgaun K. An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126 (2000) 106-130
25. Jin H.D., Leung K.S., Wong M.L., and Xu Z.B. An efficient self-organizing map designed by genetic algorithms for the traveling salesman problem. IEEE Trans. Syst. Man Cybernet. 33 6 (2003) 877-888
26. Johnson D.S., and McGeoch L.A. The traveling salesman problem: a case study in local optimization. In: Aarts E.H.L., and Lenstra J.K. (Eds). Local Search in Combinatorial Optimization (1997), Wiley, London 215-310
27. Johnson D.S., and McGeoch L.A. Experimental analysis of heuristics for the STSP. In: Gutin G., and Punnen A. (Eds). Traveling salesman problem and its variations (2002), Kluwer Academic Publishers, Dordrecht 369-443
28. Kohonen T. Self-Organization Maps and Associative Memory. Third ed. (2001), Springer, Berlin
29. T. Kohonen, Clustering, taxonomy, and topological maps of patterns, in: Proceedings of the Sixth International Conference on Pattern Recognition, 1982.
30. Krasnogor N. A tutorial for competent memetic algorithms: model, taxonomy, and design issues. IEEE Trans. Evolut. Comput. 9 5 (2005) 474-488
31. Leung K.S., Jin H.D., and Xu Z.B. An expanding self-organizing neural network for the travelling salesman problem. Neurocomputing 62 (2004) 267-292
32. Lin S., and Kernighan B.W. An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21 (1973) 498-516
33. Matsuyama Y. Self-organization neural networks and various Euclidean traveling salesman problems. Syst. Comput. Japan 23 2 (1992) 101-112
34. P. Merz, Memetic algorithms for combinatorial optimization problems: Fitness, landscapes and effective search strategies, Ph. D Thesis, Parallel Systems Research Group, Department of Electrical Engineering and Computer Science, University of Siegen, Germany, 2000.
35. Merz P., and Freisleben B. Memetic algorithms for the traveling salesman problem. Complex Syst. 13 4 (2001) 297-345
36. Modares A., Somhom S., and Enkawa T. A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. Int. Trans. Oper. Res. 6 (1999) 591-606
37. Moscato P., and Cotta C. A gentle introduction to memetic algorithms. In: Glover F., and Kochenberger G. (Eds). Handbook of Metaheuristics (2003), Kluwer Academic Publishers, Boston, MA 105-144
38. Mühlenbein H. Evolution in time and space-the parallel genetic algorithm. In: Rawlins G. (Ed). Foundations of Genetic Algorithms (1991), Morgan Kaufmann, Los Altos, CA
39. Nguyen H.D., Yoshihara I., Yamamori K., and Yasunaga M. Implementation of an effective hybrid ga for large-scale traveling salesman problems. IEEE Trans. Syst. Man Cybernet. B 37 1 (2007) 92-99
40. C.H. Papadimitriou, The Euclidean traveling salesman problem is NP-complete, Princeton University Computer Science Technical Report No. 191, 1975.
41. Preparata F.P., and Shamos M.I. Computational Geometry: An Introduction (1985), Springer, New York
42. Reinelt G. TSPLIB-A traveling salesman problem library. ORSA J. Comput. 3 (1991) 376-384
43. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). State of the Art Handbook in Metaheuristics (2002), Kluwer
44. Smith K. An argument for abandoning the traveling salesman problem as a neural network benchmark. IEEE Trans. Neural Networks 7 6 (1996) 1542-1544
45. Solomon M.M. Algorithms for the vehicle routing, and scheduling problems with time window constrains. Oper. Res. 35 (1987) 254-264
46. Somhom S., Modares A., and Enkawa T. A self-organizing model for the traveling salesman problem. J. Oper. Res. Soc. 48 (1997) 919-928
47. Vakhutinsky A.I., and Golden B.L. A hierarchical strategy for solving traveling salesman problems using elastic nets. J. Heuristics 1 (1995) 67-76
48. Vieira F.C., Doria Neto A.D., and Ferreira Costa J.A. An efficient approach to the travelling salesman problem using self-organizing maps. Int. J. Neural Syst. 2 (2003) 59-66