{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T05:11:57Z","timestamp":1783055517564,"version":"3.54.6"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,6,12]],"date-time":"2008-06-12T00:00:00Z","timestamp":1213228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10479-008-0377-3","type":"journal-article","created":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T18:43:47Z","timestamp":1213209827000},"page":"253-269","source":"Crossref","is-referenced-by-count":26,"title":["Combined location-routing problems\u2014a neural network approach"],"prefix":"10.1007","volume":"167","author":[{"given":"Martin","family":"Schwardt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kathrin","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,6,12]]},"reference":[{"key":"377_CR1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0305-0548(03)00245-4","volume":"32","author":"M. Albareda-Sambola","year":"2005","unstructured":"Albareda-Sambola, M., Diaz, J. A., & Fernandez, E. (2005). A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research, 32, 407\u2013428.","journal-title":"Computers and Operations Research"},{"key":"377_CR2","first-page":"117","volume":"13","author":"S. Amin","year":"1994","unstructured":"Amin, S., Fern\u00e1ndez-Villaca\u00f1as, J.-L., & Cochrane, P. (1994). A natural solution to the travelling salesman problem. British Telecommunications Engineering, 13, 117\u2013122.","journal-title":"British Telecommunications Engineering"},{"key":"377_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0893-6080(88)90002-0","volume":"1","author":"B. Ang\u00e9niol","year":"1988","unstructured":"Ang\u00e9niol, B., de la Croix Vaubois, G., & le Texier, J. Y. (1988). Self-organizing feature maps and the travelling salesman problem. Neural Networks, 1, 289\u2013293.","journal-title":"Neural Networks"},{"key":"377_CR4","first-page":"7","volume-title":"Vehicle routing: Methods and studies","author":"A. A. Assad","year":"1988","unstructured":"Assad, A. A. (1988). Modelling and implementation issues in routing. In B.\u00a0L. Golden & A.\u00a0A. Assad (Eds.), Vehicle routing: Methods and studies (pp.\u00a07\u201345). Amsterdam: Elsevier."},{"key":"377_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/978-1-4612-5355-6_19","volume-title":"Facility location\u2014a survey of applications and methods","author":"O. Berman","year":"1995","unstructured":"Berman, O., Jaillet, P., & Simchi-Levi, D. (1995). Location-routing problems with uncertainty. In Z. Drezner (Ed.), Facility location\u2014a survey of applications and methods (pp.\u00a0427\u2013452). New York: Springer."},{"key":"377_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/978-1-4612-5355-6_2","volume-title":"Facility location\u2014a survey of applications and methods","author":"J. Brimberg","year":"1995","unstructured":"Brimberg, J., & Love, R. F. (1995). Estimating distances. In Z. Drezner (Ed.), Facility location\u2014a survey of applications and methods (pp. 9\u201332). New York: Springer."},{"key":"377_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0305-0548(95)00017-G","volume":"23","author":"L. I. Burke","year":"1996","unstructured":"Burke, L. I. (1996). \u201cConscientious\u201d neural nets for tour construction in the traveling salesman problem: The vigilant net. Computers and Operations Research, 23, 121\u2013129.","journal-title":"Computers and Operations Research"},{"key":"377_CR8","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1287\/trsc.10.4.348","volume":"10","author":"R. C. Burness","year":"1976","unstructured":"Burness, R. C., & White, J. A. (1976). The traveling salesman location problem. Transportation Science, 10, 348\u2013360.","journal-title":"Transportation Science"},{"key":"377_CR9","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1111\/j.1540-5915.1993.tb00500.x","volume":"24","author":"T. W. Chien","year":"1993","unstructured":"Chien, T. W. (1993). Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems. Decision Sciences, 24, 995\u20131021.","journal-title":"Decision Sciences"},{"key":"377_CR10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle-dispatching problem. Operational Research Quarterly, 20, 309\u2013318.","journal-title":"Operational Research Quarterly"},{"key":"377_CR11","first-page":"315","volume-title":"Combinatorial optimization","author":"N. Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, & C. Sandi (Eds.), Combinatorial optimization (pp.\u00a0315\u2013338). Chichester: Wiley."},{"key":"377_CR12","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568\u2013581.","journal-title":"Operations Research"},{"key":"377_CR13","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1016\/S0893-6080(03)00056-X","volume":"16","author":"E. M. Cochrane","year":"2003","unstructured":"Cochrane, E. M., & Beasley, J. E. (2003). The co-adaptive neural network approach to the Euclidean traveling salesman problem. Neural Networks, 16, 1499\u20131525.","journal-title":"Neural Networks"},{"key":"377_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-56082-8_1","volume-title":"Facility location\u2014applications and theory","author":"Z. Drezner","year":"2002","unstructured":"Drezner, Z., Klamroth, K., Sch\u00f6bel, A., & Wesolowsky, G. O. (2002). The Weber problem. In Z. Drezner & H. W. Hamacher (Eds.), Facility location\u2014applications and theory (pp. 1\u201336). Berlin: Springer."},{"key":"377_CR15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E. Erkut","year":"1989","unstructured":"Erkut, E., & Neuman, S. (1989). Analytical models for locating undesirable facilities. European Journal of Operational Research, 40, 275\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"377_CR16","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"M. L. Fisher","year":"1994","unstructured":"Fisher, M. L. (1994). Optimal solution of vehicle routing problems using minimum K-trees. Operations Research, 42, 626\u2013642.","journal-title":"Operations Research"},{"key":"377_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF00336888","volume":"59","author":"J. C. Fort","year":"1988","unstructured":"Fort, J. C. (1988). Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem. Biological Cybernetics, 59, 33\u201340.","journal-title":"Biological Cybernetics"},{"key":"377_CR18","first-page":"829","volume-title":"Artificial neural networks","author":"H. Ghaziri","year":"1991","unstructured":"Ghaziri, H. (1991). Solving routing problems by a self-organizing map. In T. Kohonen, K. M\u00e4kisara, O.\u00a0Simula, & J.\u00a0Kangas (Eds.), Artificial neural networks (pp. 829\u2013834). Amsterdam: Elsevier."},{"key":"377_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic."},{"key":"377_CR20","unstructured":"Goldstein, M. (1990). Self-organizing feature maps for the multiple travelling salesmen problem (MTSP). In IEEE international conference on neural networks (pp.\u00a0258\u2013261)."},{"key":"377_CR21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0377-2217(94)90010-8","volume":"76","author":"P. H. Hansen","year":"1994","unstructured":"Hansen, P. H., Hegedahl, B., Hjortkjaer, S., & Obel, B. (1994). A heuristic solution to the warehouse location-routing problem. European Journal of Operational Research, 76, 111\u2013127.","journal-title":"European Journal of Operational Research"},{"key":"377_CR22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. J. Hopfield","year":"1985","unstructured":"Hopfield, J. J., & Tank, D. W. (1985). \u201cNeural\u201d computation of decisions in optimization problems. Biological Cybernetics, 52, 141\u2013152.","journal-title":"Biological Cybernetics"},{"key":"377_CR23","first-page":"215","volume-title":"Local search in combinatorial optimization","author":"D. S. Johnson","year":"1997","unstructured":"Johnson, D. S., & McGeoch, L. A. (1997). The travelling salesman problem: A case study. In E.\u00a0H.\u00a0L. Aarts & J.\u00a0K. Lenstra (Eds.), Local search in combinatorial optimization (pp.\u00a0215\u2013310). Chichester: Wiley."},{"key":"377_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF00337288","volume":"43","author":"T. Kohonen","year":"1982","unstructured":"Kohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43, 59\u201369.","journal-title":"Biological Cybernetics"},{"key":"377_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56927-2","volume-title":"Self-organizing maps","author":"T. Kohonen","year":"2001","unstructured":"Kohonen, T. (2001). Self-organizing maps (3rd edn). Berlin: Springer.","edition":"3"},{"key":"377_CR26","first-page":"161","volume-title":"Vehicle routing: methods and studies","author":"G. Laporte","year":"1988","unstructured":"Laporte, G. (1988). Location routing problems. In B.\u00a0L. Golden & A.\u00a0A. Assad (Eds.), Vehicle routing: methods and studies (pp.\u00a0161\u2013197). Amsterdam: Elsevier Science."},{"key":"377_CR27","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0377-2217(81)90212-5","volume":"6","author":"G. Laporte","year":"1981","unstructured":"Laporte, G., & Nobert, Y. (1981). An exact algorithm for minimizing routing and operating costs in depot location. European Journal of Operational Research, 6, 224\u2013226.","journal-title":"European Journal of Operational Research"},{"key":"377_CR28","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G. Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., & Taillefer, S. (1988). Solving a family of multi-depot vehicle routing and location\u2013routing problems. Transportation Science, 22, 161\u2013172.","journal-title":"Transportation Science"},{"key":"377_CR29","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(97)00046-5","volume":"108","author":"S. Lozano","year":"1998","unstructured":"Lozano, S., Guerrero, F., Onieva, L., & Larraneta, J. (1998). Kohonen maps for solving a class of location-allocation problems. European Journal of Operational Research, 108, 106\u2013117.","journal-title":"European Journal of Operational Research"},{"key":"377_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)00172-0","volume":"108","author":"H. Min","year":"1998","unstructured":"Min, H., Jayaraman, V., & Srivastava, R. (1998). Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research, 108, 1\u201315.","journal-title":"European Journal of Operational Research"},{"key":"377_CR31","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1111\/j.1475-3995.1999.tb00175.x","volume":"6","author":"A. Modares","year":"1999","unstructured":"Modares, A., Somhom, S., & Enkawa, T. (1999). A self-organising neural network approach for multiple traveling salesman and vehicle routing problems. International Transactions in Operational Research, 6, 591\u2013606.","journal-title":"International Transactions in Operational Research"},{"key":"377_CR32","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1057\/jors.1996.144","volume":"47","author":"G. Nagy","year":"1996","unstructured":"Nagy, G., & Salhi, S. (1996). Nested heuristic methods for the location\u2013routing problem. Journal of the Operational Research Society, 47, 1166\u20131174.","journal-title":"Journal of the Operational Research Society"},{"key":"377_CR33","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0377-2217(88)90154-3","volume":"34","author":"H. Paessens","year":"1988","unstructured":"Paessens, H. (1988). The savings algorithm for the vehicle routing problem. European Journal of Operational Research, 34, 336\u2013344.","journal-title":"European Journal of Operational Research"},{"key":"377_CR34","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/978-1-4612-5355-6_12","volume-title":"Facility location\u2014a survey of applications and methods","author":"F. Plastria","year":"1995","unstructured":"Plastria, F. (1995). Continuous location problems. In Z. Drezner (Ed.), Facility location\u2014a survey of applications and methods (pp.\u00a0225\u2013262). New York: Springer."},{"key":"377_CR35","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSPLIB\u2014a traveling salesman problem library. ORSA Journal on Computing, 3, 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"key":"377_CR36","volume-title":"Flexible Tourenplanung mit selbstorganisierenden Netzen","author":"R. Retzko","year":"1996","unstructured":"Retzko, R. (1996). Flexible Tourenplanung mit selbstorganisierenden Netzen. Bovenden: Unitext-Verlag (in German)."},{"key":"377_CR37","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","volume":"39","author":"S. Salhi","year":"1989","unstructured":"Salhi, S., & Rand, G. K. (1989). The effect of ignoring routes when locating depots. European Journal of Operational Research, 39, 150\u2013156.","journal-title":"European Journal of Operational Research"},{"key":"377_CR38","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1108\/09600030510611639","volume":"35","author":"M. Schwardt","year":"2005","unstructured":"Schwardt, M., & Dethloff, J. (2005). Solving a continuous location-routing problem by use of a self-organizing map. International Journal of Physical Distribution and Logistics Management, 35, 390\u2013408.","journal-title":"International Journal of Physical Distribution and Logistics Management"},{"key":"377_CR39","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1287\/trsc.25.1.9","volume":"25","author":"D. Simchi-Levi","year":"1991","unstructured":"Simchi-Levi, D. (1991). The capacitated traveling salesman location problem. Transportation Science, 25, 9\u201318.","journal-title":"Transportation Science"},{"key":"377_CR40","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0305-0548(98)00069-0","volume":"26","author":"S. Somhom","year":"1999","unstructured":"Somhom, S., Modares, A., & Enkawa, T. (1999). Competition-based neural network for the multiple travelling salesmen problem with minimax objective. Computers and Operations Research, 26, 395\u2013407.","journal-title":"Computers and Operations Research"},{"key":"377_CR41","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0360-8352(97)00171-X","volume":"33","author":"A. Torki","year":"1997","unstructured":"Torki, A., Somhom, S., & Enkawa, T. (1997). A competitive neural network algorithm for solving vehicle routing problem. Computers and Industrial Engineering, 33, 473\u2013476.","journal-title":"Computers and Industrial Engineering"},{"key":"377_CR42","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0377-2217(98)00107-6","volume":"116","author":"D. Tuzun","year":"1999","unstructured":"Tuzun, D., & Burke, L. I. (1999). A two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 116, 87\u201399.","journal-title":"European Journal of Operational Research"},{"key":"377_CR43","unstructured":"Weber, A. (1909). \u00dcber den Standort der Industrien. T\u00fcbingen."},{"key":"377_CR44","first-page":"355","volume":"43","author":"E. Weiszfeld","year":"1937","unstructured":"Weiszfeld, E. (1937). Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum. Tohoku Mathematical Journal, 43, 355\u2013386.","journal-title":"Tohoku Mathematical Journal"},{"key":"377_CR45","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","volume":"29","author":"T.-H. Wu","year":"2002","unstructured":"Wu, T.-H., Low, C., & Bai, J.-W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research, 29, 1393\u20131415.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0377-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0377-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0377-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T19:51:55Z","timestamp":1684439515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0377-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,12]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["377"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0377-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,12]]}}}