Competition-based neural network for the multiple travelling salesmen problem with minmax objective

Computers and Operations Research

Volumn 26, Issue 4, 1999, Pages 395-407

  Somhom, Samerkae ^a   Modares, Abdolhamid ^a   Enkawa, Takao ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Competition based neural network; Multiple travelling salesmen problem; Optimization

Indexed keywords

ADAPTIVE ALGORITHMS; HEURISTIC METHODS; NEURAL NETWORKS; PROBLEM SOLVING;

ADAPTIVE TABU SEARCH; COMPETITION-BASED NEURAL NETWORKS;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; METHODOLOGY; NETWORKING;

EID: 0032790197     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00069-0     Document Type: Article

References (37)

1. [1] Laporte G, Osman IH. Routing problems: a bibliography. Annales of Operational Research 1995;61:227-62.
2. [2] Lawler EL, Lenstra JK, Kan Rinnooy AHG, Shmoys DB. The traveling salesman problem: a guided tour of combinatorial optimization. Chichester: Wiley, 1985.
3. [3] Laporte G. The travelling salesman problem: an overview of exact and approximate algorithms. European Journal of Operational Research 1992;59:231-47.
4. [4] Angel RD, Caudle WL, Noonan R, Whinson A. Computer assisted school bus scheduling. Management Science 1972;18:279-88.
5. [5] Orloff DS. Routing a fleet of M vehicles to/from a central facility. Networks 1974;4:147-62.
6. [6] Christofides N, Eilon S. An algorithm for the vehicle dispatching problem. Operations Research Quarterly 1969;20:309-18.
7. [7] Savelsbergh MWP. The general pickup and delivery problem. Transactions of Science 1995;29(1):17-29.
8. [8] Svestka JA, Huckfeldt VE. Computational experience with an m-salesman traveling salesman algorithm. Management Science 1973;19:790-9.
9. [9] Bellmore M, Hong S. Transformation of multisalesmen problem to the standard traveling salesman problem. Jurnal of the Association Computer Machinery 1974;21:500-4.
10. [10] Lenstra JK, Rinnooy Kan AHG. Some simple applications of the traveling salesman problem. Operations Research Quarterly 1975;26:717-34.
11. [11] Laporte G, Nobert Y. A cutting planes algorithms for the m-salesmen problem. Operations Research Quarterly 1980;31:1017-23.
12. [12] França PM, Gendreau A, Laporte G, Müller FM. The m-traveling salesman problem with minmax objective. Transactions of Science 1995;29(3):267-75.
13. [13] Giust E. Optimisation de tournées de véhicules. Application à la distribution de gaz . M.Sc. Dissertation, Facultés Universitaires Notre-Dame de la Paix, Namur, Belgium, 1992.
14. [14] Hopfield JJ, Tank DW. Neural computation of decisions in optimization problems. Biology in Cybernetico 1985;52:141-52.
15. [15] Wilson GV, Pawley GS. On the stability of the travelling salesman problem algorithm of hopfield and Tank. Biology in Cybernetics 1988;58:63-70.
16. [16] Angeniol B, de la Croix Vaubois G, le Texier J. Self-organizing feature maps and the travelling salesman problem. Neural Networks 1988;1(4):289-93.
17. [17] Favata F, Walker R. A study of the application of Kohonen-type neural networks to the travelling salesman problem. Biology in Cybernetics 1991;64:463-8.
18. [18] Potvin J. The traveling salesman problem: a neural network perspective. ORSA Journal of Computers 1993;5(4):328-48.
19. [19] Burke LI, Neural methods for the traveling salesman problem: insights from operations research. Neural Networks 1994;7(4):681-90.
20. [20] Kohonen T. Self-organization and associative memory. Berlin: Springer, 1984.
21. [21] Burke LI, Ignizio JP. Neural networks and operations research: an overview. Computers Ops. Res. 1992;19(3/4):179-89.
22. [22] Matsuyama Y. Self-organization neural networks and various euclidean traveling salesman problems. Systems and Computers in Japan 1992;23(2):101-12.
23. [23] Somhom S, Modares A, Enkawa T. A self-organising model for the travelling salesman problem. Journal of Operational Research Society 1997;48:919-28.
24. [24] Potvin J, Lapalme G, Rousseau J. A generalized k-opt exchange procedure for the MTSP. INFOR. 1989;27(4):474-81.
25. [25] Lin, S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 1965;44:2245-69.
26. [26] Lin S, Kernighan B. An effictive Heuristic algorithm for the traveling salesman problem. Operational Research 1973;21:498-516.
27. [27] Frederickson GN, Hecht MS, Kim CE. Approximation algorithms for some routing problems. SIAM Journal on Computing 1978;7:178-93.
28. [28] Wacholder E, Han J, Mann RC. A neural network algorithm for the multiple traveling salesmen problem. Biology in Cybernetics 1989;61:11-9.
29. [29] Durbin R, Willshaw DJ. An analogue approach to the traveling salesman problem using an elastic net method. Nature 1987;326:689-91.
30. [30] Vakhutinsky IA, Golden LB. Solving vehicle routing problems using elastic net. Proceedings of IEEE International Conference on Neural Network, 1994;4535-40.
31. [31] Ghaziri HEL. Solving routing problems by a self-organizing map. In: Kohonen T, Makisara K, Simula O, Kangas J, Editors. Artificial Neural Networks. Amsterdam: North-Holland, 1991:829-34.
32. [32] Goldstein M. Self-organizing feature maps for the Multiple Traveling Salesmen Problem. Proceedings of IEEE International Conference on Neural Network, San Diego, CA 1990;258-61.
33. [33] Reinelt G. TSPLIB-A Traveling Salesman Problem Library. ORSA Journal of Computer 1991a;3:376-84.
34. [34] Pirlot M. General local search methods. European Journal of Operation Research 1996;92:493-511.
35. [35] Gendreau M, Hertz A, Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science 1994;40:1276-90.
36. [36] Rego C. Relaxed tours and path ejections for the traveling salesman problem. European Journal of Operation Research 1998;106:522-38.
37. [37] Golden BL, Laporte G, Taillard ED. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Computers Operations Research 1997;24(5):445-52.