Combined location-routing problems-a neural network approach

Annals of Operations Research

Volumn 167, Issue 1, 2009, Pages 253-269

  Schwardt, Martin ^a   Fischer, Kathrin ^b  

^a Lübecker Hafengesellschaft MbH ^*  (Germany)

^b VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

Author keywords

Euclidean distance; Location routing problems; Neural networks; Self organising maps; Weber problem

Indexed keywords

EID: 67349228754     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0377-3     Document Type: Article

References (45)

1. M. Albareda-Sambola J. A. Diaz E. Fernandez 2005 A compact model and tight bounds for a combined location-routing problem Computers and Operations Research 32 407 428
2. S. Amin J.-L. Fernández-Villacañas P. Cochrane 1994 A natural solution to the travelling salesman problem British Telecommunications Engineering 13 117 122
3. B. Angéniol G. de la Croix Vaubois J. Y. le Texier 1988 Self-organizing feature maps and the travelling salesman problem Neural Networks 1 289 293
4. Assad, A. A. (1988). Modelling and implementation issues in routing. In B. L. Golden & A. A. Assad (Eds.), Vehicle routing: Methods and studies (pp. 7-45). Amsterdam: Elsevier.
5. Berman, O., Jaillet, P., & Simchi-Levi, D. (1995). Location-routing problems with uncertainty. In Z. Drezner (Ed.), Facility location-a survey of applications and methods (pp. 427-452). New York: Springer.
6. Brimberg, J., & Love, R. F. (1995). Estimating distances. In Z. Drezner (Ed.), Facility location-a survey of applications and methods (pp. 9-32). New York: Springer.
7. L. I. Burke 1996 "Conscientious" neural nets for tour construction in the traveling salesman problem: The vigilant net Computers and Operations Research 23 121 129 (Pubitemid 126347728)
8. R. C. Burness J. A. White 1976 The traveling salesman location problem Transportation Science 10 348 360
9. T. W. Chien 1993 Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems Decision Sciences 24 995 1021
10. N. Christofides S. Eilon 1969 An algorithm for the vehicle-dispatching problem Operational Research Quarterly 20 309 318
11. Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, & C. Sandi (Eds.), Combinatorial optimization (pp. 315-338). Chichester: Wiley.
12. G. Clarke J. W. Wright 1964 Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 568 581
13. E. M. Cochrane J. E. Beasley 2003 The co-adaptive neural network approach to the Euclidean traveling salesman problem Neural Networks 16 1499 1525 (Pubitemid 37386365)
14. Drezner, Z., Klamroth, K., Schöbel, A., & Wesolowsky, G. O. (2002). The Weber problem. In Z. Drezner & H. W. Hamacher (Eds.), Facility location-applications and theory (pp. 1-36). Berlin: Springer.
15. E. Erkut S. Neuman 1989 Analytical models for locating undesirable facilities European Journal of Operational Research 40 275 291
16. M. L. Fisher 1994 Optimal solution of vehicle routing problems using minimum K-trees Operations Research 42 626 642
17. J. C. Fort 1988 Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem Biological Cybernetics 59 33 40
18. Ghaziri, H. (1991). Solving routing problems by a self-organizing map. In T. Kohonen, K. Mäkisara, O. Simula, & J. Kangas (Eds.), Artificial neural networks (pp. 829-834). Amsterdam: Elsevier.
19. Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic.
20. Goldstein, M. (1990). Self-organizing feature maps for the multiple travelling salesmen problem (MTSP). In IEEE international conference on neural networks (pp. 258-261).
21. P. H. Hansen B. Hegedahl S. Hjortkjaer B. Obel 1994 A heuristic solution to the warehouse location-routing problem European Journal of Operational Research 76 111 127
22. J. J. Hopfield D. W. Tank 1985 "Neural" computation of decisions in optimization problems Biological Cybernetics 52 141 152 (Pubitemid 15007505)
23. Johnson, D. S., & McGeoch, L. A. (1997). The travelling salesman problem: A case study. In E. H. L. Aarts & J. K. Lenstra (Eds.), Local search in combinatorial optimization (pp. 215-310). Chichester: Wiley.
24. T. Kohonen 1982 Self-organized formation of topologically correct feature maps Biological Cybernetics 43 59 69
25. Kohonen, T. (2001). Self-organizing maps (3rd edn). Berlin: Springer.
26. Laporte, G. (1988). Location routing problems. In B. L. Golden & A. A. Assad (Eds.), Vehicle routing: methods and studies (pp. 161-197). Amsterdam: Elsevier Science.
27. G. Laporte Y. Nobert 1981 An exact algorithm for minimizing routing and operating costs in depot location European Journal of Operational Research 6 224 226 (Pubitemid 11466204)
28. G. Laporte Y. Nobert S. Taillefer 1988 Solving a family of multi-depot vehicle routing and location-routing problems Transportation Science 22 161 172 (Pubitemid 18654114)
29. S. Lozano F. Guerrero L. Onieva J. Larraneta 1998 Kohonen maps for solving a class of location-allocation problems European Journal of Operational Research 108 106 117 (Pubitemid 128372590)
30. H. Min V. Jayaraman R. Srivastava 1998 Combined location-routing problems: A synthesis and future research directions European Journal of Operational Research 108 1 15 (Pubitemid 128372582)
31. A. Modares S. Somhom T. Enkawa 1999 A self-organising neural network approach for multiple traveling salesman and vehicle routing problems International Transactions in Operational Research 6 591 606
32. G. Nagy S. Salhi 1996 Nested heuristic methods for the location-routing problem Journal of the Operational Research Society 47 1166 1174 (Pubitemid 126605013)
33. H. Paessens 1988 The savings algorithm for the vehicle routing problem European Journal of Operational Research 34 336 344 (Pubitemid 18579989)
34. Plastria, F. (1995). Continuous location problems. In Z. Drezner (Ed.), Facility location-a survey of applications and methods (pp. 225-262). New York: Springer.
35. G. Reinelt 1991 TSPLIB-a traveling salesman problem library ORSA Journal on Computing 3 376 384
36. Retzko, R. (1996). Flexible Tourenplanung mit selbstorganisierenden Netzen. Bovenden: Unitext-Verlag (in German).
37. S. Salhi G. K. Rand 1989 The effect of ignoring routes when locating depots European Journal of Operational Research 39 150 156
38. M. Schwardt J. Dethloff 2005 Solving a continuous location-routing problem by use of a self-organizing map International Journal of Physical Distribution and Logistics Management 35 390 408 (Pubitemid 41112456)
39. D. Simchi-Levi 1991 The capacitated traveling salesman location problem Transportation Science 25 9 18
40. S. Somhom A. Modares T. Enkawa 1999 Competition-based neural network for the multiple travelling salesmen problem with minimax objective Computers and Operations Research 26 395 407 (Pubitemid 29346468)
41. A. Torki S. Somhom T. Enkawa 1997 A competitive neural network algorithm for solving vehicle routing problem Computers and Industrial Engineering 33 473 476 (Pubitemid 127406826)
42. D. Tuzun L. I. Burke 1999 A two-phase tabu search approach to the location routing problem European Journal of Operational Research 116 87 99
43. Weber, A. (1909). Über den Standort der Industrien. Tübingen.
44. E. Weiszfeld 1937 Sur le point pour lequel la somme des distances de n points donnés est minimum Tohoku Mathematical Journal 43 355 386
45. T.-H. Wu C. Low J.-W. Bai 2002 Heuristic solutions to multi-depot location-routing problems Computers and Operations Research 29 1393 1415 (Pubitemid 34409654)