{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T09:45:42Z","timestamp":1781948742722,"version":"3.54.5"},"reference-count":51,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s13675-016-0076-9","type":"journal-article","created":{"date-parts":[[2016,10,5]],"date-time":"2016-10-05T06:04:31Z","timestamp":1475647471000},"page":"367-392","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Matheuristics for optimizing the network in German wagonload traffic"],"prefix":"10.1016","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5846-9501","authenticated-orcid":false,"given":"Julia","family":"Sender","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Siwczyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uwe","family":"Clausen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1007\/s13675-016-0076-9_CR1","series-title":"Local search in combinatorial optimization","author":"Aarts","year":"2003"},{"issue":"3","key":"10.1007\/s13675-016-0076-9_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1108\/09600030110389532","article-title":"Using simulated annealing to solve the p-hub median problem","volume":"31","author":"Abdinnour-Helm","year":"2001","journal-title":"Int J Phys Distrib Logist Manag"},{"key":"10.1007\/s13675-016-0076-9_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1018954217758","article-title":"Solution approaches to hub location problems","volume":"78","author":"Abdinnour-Helm","year":"1998","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","article-title":"Network hub location problems: the state of the art","volume":"190","author":"Alumur","year":"2008","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR5","series-title":"Facility location. Applications and theory, chapter 12","first-page":"373","article-title":"Hub location problems","author":"Campbell","year":"2002"},{"key":"10.1007\/s13675-016-0076-9_CR6","doi-asserted-by":"crossref","unstructured":"Campbell JF, Ernst AT, Krishnamoorthy M (2005a) Hub arc location problems: part I\u2014introduction and results. Manag Sci 51:1540\u20131555","DOI":"10.1287\/mnsc.1050.0406"},{"key":"10.1007\/s13675-016-0076-9_CR7","doi-asserted-by":"crossref","unstructured":"Campbell JF, Ernst AT, Krishnamoorthy M (2005b) Hub arc location problems: part II\u2014formulations and optimal algorithms. Manag Sci 51:1556\u20131571","DOI":"10.1287\/mnsc.1050.0407"},{"issue":"2","key":"10.1007\/s13675-016-0076-9_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","article-title":"Twenty-five years of hub location research","volume":"45","author":"Campbell","year":"2012","journal-title":"Transp Sci"},{"key":"10.1007\/s13675-016-0076-9_CR9","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1016\/j.ejor.2005.08.028","article-title":"Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique","volume":"179","author":"C\u00e1novas","year":"2007","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1007\/s13675-016-0076-9_CR10","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1002\/net.20020","article-title":"Solving the hub locatin problem in telecommunication network design: a local search approach","volume":"44","author":"Carello","year":"2004","journal-title":"Networks"},{"key":"10.1007\/s13675-016-0076-9_CR11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/trsc.1110.0398","article-title":"Exact solution of large-scale hub-location problems with multiple capacity levels","volume":"46","author":"Contreras","year":"2012","journal-title":"Transp Sci"},{"key":"10.1007\/s13675-016-0076-9_CR12","unstructured":"Contreras\u00a0Aguilar IA (2009) Network hub location: models, algorithms, and related problems. Ph.D. thesis, Universitat Polit\u00e8cnica de Catalunya"},{"key":"10.1007\/s13675-016-0076-9_CR13","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.trb.2009.12.016","article-title":"Single-assignment hub location problems with multiple capacity levels","volume":"44","author":"Correia","year":"2010","journal-title":"Transp Res Part B: Methodol"},{"issue":"1","key":"10.1007\/s13675-016-0076-9_CR14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer Math"},{"key":"10.1007\/s13675-016-0076-9_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","article-title":"Efficient algorithms for the uncapacitated single allocation p-hub median problem","volume":"4","author":"Ernst","year":"1996","journal-title":"Locat Sci"},{"issue":"2","key":"10.1007\/s13675-016-0076-9_CR16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.10.2.149","article-title":"An exact solution approach based on shortest-paths for p-hub median problems","volume":"10","author":"Ernst","year":"1998","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-016-0076-9_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/A:1018994432663","article-title":"Solution algorithms for the capacitated single allocation hub location problem","volume":"86","author":"Ernst","year":"1999","journal-title":"Ann Oper Res"},{"issue":"4","key":"10.1007\/s13675-016-0076-9_CR18","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multi-commodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J Comput"},{"key":"10.1007\/s13675-016-0076-9_CR19","doi-asserted-by":"crossref","unstructured":"Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64(4):1096\u20131109. doi:10.1016\/j.cie.2013.01.012. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835213000326","DOI":"10.1016\/j.cie.2013.01.012"},{"issue":"1","key":"10.1007\/s13675-016-0076-9_CR20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.2013.0486","article-title":"Single-car routing in rail freight transport","volume":"49","author":"F\u00fcgenschuh","year":"2013","journal-title":"Transp Sci"},{"key":"10.1007\/s13675-016-0076-9_CR21","unstructured":"Gelareh S (2008) Hub location models in public transportation planning. Ph.D. thesis, Technische Universit\u00e4t Kaiserslautern"},{"key":"10.1007\/s13675-016-0076-9_CR22","doi-asserted-by":"crossref","unstructured":"Gendreau M, Potvin JY (eds) (2010a) Handbook of metaheuristics, 2nd edn. Springer, New York","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"10.1007\/s13675-016-0076-9_CR23","doi-asserted-by":"crossref","unstructured":"Gendreau M, Potvin JY (2010b) Tabu search. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, 2nd edn. Springer, New York, pp 41\u201359","DOI":"10.1007\/978-1-4419-1665-5_2"},{"key":"10.1007\/s13675-016-0076-9_CR24","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.ejor.2010.09.017","article-title":"Hub location-allocation in intermodal logistic networks","volume":"210","author":"Ishfaq","year":"2011","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0966-8349(96)00016-2","article-title":"Airline network design and hub location problems","volume":"4","author":"Jailett","year":"1996","journal-title":"Locat Sci"},{"key":"10.1007\/s13675-016-0076-9_CR26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0377-2217(91)90090-I","article-title":"Heuristics for the p-hub location problem","volume":"53","author":"Klincewicz","year":"1991","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR27","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/BF02060483","article-title":"Avoiding local optima in the p-hub location problem using tabu search and grasp","volume":"40","author":"Klincewicz","year":"1992","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR28","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1020715517162","article-title":"Enumeration and search procedures for a hub location problem with economies of scale","volume":"110","author":"Klincewicz","year":"2002","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR29","doi-asserted-by":"crossref","first-page":"63","DOI":"10.26552\/com.C.2009.3.63-67","article-title":"Methods and techniques for design of effective and competitive single wagon load transportation","volume":"11","author":"Kohani","year":"2009","journal-title":"Communications"},{"issue":"2","key":"10.1007\/s13675-016-0076-9_CR30","doi-asserted-by":"crossref","first-page":"1858","DOI":"10.1016\/j.asoc.2010.05.035","article-title":"An evolutionary-based approach for solving a capacitated hub location problem","volume":"11","author":"Kratica","year":"2011","journal-title":"Appl Soft Comput"},{"key":"10.1007\/s13675-016-0076-9_CR31","doi-asserted-by":"crossref","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) (2009) Matheuristics. Hybridizing metaheuristics and mathematical programming, 1st ed. Springer, New York","DOI":"10.1007\/978-1-4419-1306-7"},{"key":"10.1007\/s13675-016-0076-9_CR32","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0377-2217(98)00195-7","article-title":"Location of hubs in a competitive enviroment","volume":"114","author":"Marianov","year":"1999","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR33","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.ejor.2004.09.047","article-title":"New formulations for the uncapacitated multiple allocation hub location problem","volume":"172","author":"Mar\u00edn","year":"2006","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR34","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0377-2217(94)00334-3","article-title":"Tactical design of rail freight networks. I: Exact and heuristic methods","volume":"90","author":"Mar\u00edn","year":"1996","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR35","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/S0305-0548(01)00080-6","article-title":"An exact solution method for the multiple allocation hub location problem","volume":"29","author":"Mayer","year":"2002","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR36","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.endm.2013.05.073","article-title":"Strategic planning in ltl logistics\u2014increasing the capacity utilization of trucks","volume":"41","author":"Meier","year":"2013","journal-title":"Electron Notes Discrete Math"},{"key":"10.1007\/s13675-016-0076-9_CR37","unstructured":"Nemani AK, Ahuja RK (2010) OR models in freight railroad industry. In: Wiley encyclopedia of operations research and management science. Wiley, pp 3925\u20133944"},{"issue":"1","key":"10.1007\/s13675-016-0076-9_CR38","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0966-6923(94)90032-9","article-title":"The hub network design problem: a review and synthesis","volume":"2","author":"O\u2019Kelly","year":"1994","journal-title":"J Transp Geogr"},{"key":"10.1007\/s13675-016-0076-9_CR39","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.trb.2004.07.001","article-title":"Optimal location of intermodal freight hubs","volume":"39","author":"Racunica","year":"2005","journal-title":"Transp Res Part B"},{"key":"10.1007\/s13675-016-0076-9_CR40","doi-asserted-by":"crossref","unstructured":"Reeves CR (2010) Genetic algorithms. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, 2nd edn. Springer Publishing Company, Incorporated, New York, pp 109\u2013139. 10.1007\/978-1-4419-1665-5_5","DOI":"10.1007\/978-1-4419-1665-5_5"},{"key":"10.1007\/s13675-016-0076-9_CR41","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Mart\u00edn I, Salazar-Gonz\u00e1lez JJ (2006) An iterated local search heuristic for a capacitated hub location problem. In: Almeida F, Blesa\u00a0Aguilera MJ, Blum C, Moreno\u00a0Vega JM, P\u00e9rez\u00a0P\u00e9rez M, Roli A, Sampels M (eds) Hybrid metaheuristics, lecture notes in computer science, vol 4030, pp 70\u201381","DOI":"10.1007\/11890584_6"},{"key":"10.1007\/s13675-016-0076-9_CR42","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Mart\u00edn I, Salazar-Gonz\u00e1lez JJ (2008) Solving a capacitated hub location problem. Eur J Oper Res 184(2):468\u2013479. doi:10.1016\/j.ejor.2006.11.026. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221706011647","DOI":"10.1016\/j.ejor.2006.11.026"},{"key":"10.1007\/s13675-016-0076-9_CR43","unstructured":"Sender J (2014) Diskrete Optimierungsmodelle und Algorithmen zur strategischen Standortwahl und Transportnetzplanung im Einzelwagenverkehr. Verlag Dr. Hut"},{"key":"10.1007\/s13675-016-0076-9_CR44","doi-asserted-by":"crossref","unstructured":"Sender J, Clausen U (2011a) Hub location problems with choice of different hub capacities and vehicle types. In: Pahl J, Reiners T, Vo\u00df S (eds) Network optimization, lecture notes in computer science, vol 6701, pp 535\u2013546","DOI":"10.1007\/978-3-642-21527-8_59"},{"key":"10.1007\/s13675-016-0076-9_CR45","doi-asserted-by":"crossref","unstructured":"Sender J, Clausen U (2011b) A new hub location model for network design of wagonload traffic. In: Zak J (ed) The state of the art in the European quantitative oriented transportation and logistics research 14th Euro working group on transportation and 26th mini Euro conference and 1st European scientific conference on air transport, Procedia\u2014social and behavioral sciences, vol 20, pp 90\u201399","DOI":"10.1016\/j.sbspro.2011.08.014"},{"key":"10.1007\/s13675-016-0076-9_CR46","doi-asserted-by":"crossref","unstructured":"Sender J, Clausen U (2013a) Heuristics for solving a capacitated multiple allocation hub location problem with application in german wagonload traffic. Electron Notes Discrete Math 41:13\u201320","DOI":"10.1016\/j.endm.2013.05.070"},{"key":"10.1007\/s13675-016-0076-9_CR47","unstructured":"Sender J, Clausen U (2013b) Optimizing the network in german wagonload traffic. In: Proceedings of 5th international seminar on railway operations modelling and analysis"},{"key":"10.1007\/s13675-016-0076-9_CR48","doi-asserted-by":"crossref","unstructured":"Silberholz J, Golden B (2010) Comparision of metaheuristics. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, 2nd edn. Springer, Berlin, pp 625\u2013640. 10.1007\/978-1-4419-1665-5_21.","DOI":"10.1007\/978-1-4419-1665-5_21"},{"key":"10.1007\/s13675-016-0076-9_CR49","unstructured":"Siwczyk T (2013) Optimierung von Transportnetzen im Schieneng\u00fcterverkehr mittels evolution\u00e4rer Algorithmen. Diploma thesis, Fakult\u00e4t f\u00fcr Informatik, Technische Universit\u00e4t Dortmund"},{"issue":"3","key":"10.1007\/s13675-016-0076-9_CR50","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/0377-2217(94)90245-3","article-title":"On tabu search for the location of interacting hub facilities","volume":"73","author":"Skorin-Kapov","year":"1994","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0076-9_CR51","series-title":"Handbook of applied optimization","first-page":"104","article-title":"Local search","author":"Yagiura","year":"2002"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-016-0076-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0076-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100085X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S219244062100085X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0076-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:14Z","timestamp":1761882374000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S219244062100085X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S219244062100085X"],"URL":"https:\/\/doi.org\/10.1007\/s13675-016-0076-9","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2017,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Matheuristics for optimizing the network in German wagonload traffic","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-016-0076-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2017 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}