{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:12:25Z","timestamp":1761894745725},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s00291-008-0140-9","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T07:42:11Z","timestamp":1211960531000},"page":"745-758","source":"Crossref","is-referenced-by-count":14,"title":["k-Shortest routing of trains on shunting yards"],"prefix":"10.1007","volume":"31","author":[{"given":"Jan","family":"Riezebos","sequence":"first","affiliation":[]},{"given":"Wout","family":"van Wezel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"key":"140_CR1","first-page":"361","volume-title":"The traveling salesman problem\u2014a guided tour of combinatorial optimization","author":"E Balas","year":"1985","unstructured":"Balas E, Toth P (1985) Branch and bound methods for the traveling salesman problem. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The traveling salesman problem\u2014a guided tour of combinatorial optimization. Wiley, Chichester, pp 361\u2013401"},{"key":"140_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s291-002-8198-0","volume":"24","author":"P Brucker","year":"2002","unstructured":"Brucker P, Heitmann S, Knust S (2002) Scheduling railway traffic at a construction site. OR Spectr 24: 19\u201330","journal-title":"OR Spectr"},{"key":"140_CR3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1080\/07408179808966488","volume":"30","author":"X Cai","year":"1998","unstructured":"Cai X, Goh CJ, Mees AI (1998) Greedy heuristics for rapid scheduling of trains on a single track. IIE Trans 30: 481\u2013493","journal-title":"IIE Trans"},{"key":"140_CR4","first-page":"195","volume":"37","author":"M Carey","year":"2003","unstructured":"Carey M, Carville S (2003) Scheduling and platforming trains at busy complex stations. Transp Res Part A 37: 195\u2013224","journal-title":"Transp Res Part A"},{"key":"140_CR5","first-page":"403","volume-title":"The traveling salesman problem\u2014a guided tour of combinatorial optimization","author":"V Chvatal","year":"1985","unstructured":"Chvatal V (1985) Hamiltonian cycles. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The traveling salesman problem\u2014a guided tour of combinatorial optimization. Wiley, Chichester, pp 403\u2013429"},{"issue":"4","key":"140_CR6","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/trsc.32.4.380","volume":"32","author":"JF Cordeau","year":"1998","unstructured":"Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train routing and scheduling. Transp Sci 32(4): 380\u2013404","journal-title":"Transp Sci"},{"key":"140_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/074081791008988","volume":"38","author":"MM Dessouky","year":"2006","unstructured":"Dessouky MM, Lu Q, Zhao J, Leachman C (2006) An exact solution to determine the optimal dispatching times for complex rail networks. IIE Trans 38: 141\u2013152","journal-title":"IIE Trans"},{"key":"140_CR8","unstructured":"Eppstein D (2001) Bibliography on k shortest paths and other \u2018k best solutions\u2019 problems. http:\/\/www.ics.uci.edu\/~eppstein\/bibs\/kpath.bib"},{"issue":"2","key":"140_CR9","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D Eppstein","year":"1998","unstructured":"Eppstein D (1998) Finding the k shortest paths. SIAM J Comput 28(2): 652\u2013673","journal-title":"SIAM J Comput"},{"issue":"2","key":"140_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1287\/trsc.1030.0076","volume":"39","author":"R Freling","year":"2005","unstructured":"Freling R, Lentink RM, Kroon LG, Huisman D (2005) Shunting of passenger train units in a railway station. Transp Sci 39(2): 261\u2013272","journal-title":"Transp Sci"},{"key":"140_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"HW Hamacher","year":"1985","unstructured":"Hamacher HW, Queyranne M (1985) K-best solutions to combinatorial optimization problems. Ann Oper Res 4: 123\u2013143","journal-title":"Ann Oper Res"},{"key":"140_CR12","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1016\/S0305-0548(02)00064-3","volume":"30","author":"S He","year":"2003","unstructured":"He S, Song R, Chaudhry SS (2003) An integrated dispatching model for rail yards operations. Comp Oper Res 30: 939\u2013966","journal-title":"Comp Oper Res"},{"key":"140_CR13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Manage Sci 18: 401\u2013407","journal-title":"Manage Sci"},{"key":"140_CR14","first-page":"7","volume":"20","author":"M Libura","year":"1991","unstructured":"Libura M (1991) Sensitivity analysis for minimum weight base of a matroid. Control Cybern 20: 7\u201324","journal-title":"Control Cybern"},{"issue":"2","key":"140_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.37.2.183.15251","volume":"37","author":"ME L\u00fcbbecke","year":"2003","unstructured":"L\u00fcbbecke ME, Zimmerman UT (2003a) Engine routing and scheduling at industrial in-plant railroads. Transp Sci 37(2):183\u2013197","journal-title":"Transp Sci"},{"key":"140_CR16","doi-asserted-by":"crossref","unstructured":"L\u00fcbbecke ME, Zimmerman UT (2003b) Computer aided scheduling of switching engines. In: J\u00e4ger W, Krebs HJ (eds) Mathematics\u2014key technology for the future: joint projects between universities and industry, pp 690\u2013702","DOI":"10.1007\/978-3-642-55753-8_52"},{"key":"140_CR17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230100402","volume":"10","author":"DR Shier","year":"1980","unstructured":"Shier DR, Witzgall C (1980) Arc tolerances in shortest path and network flow problems. Networks 10: 277\u2013291","journal-title":"Networks"},{"key":"140_CR18","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230060303","volume":"6","author":"DR Shier","year":"1976","unstructured":"Shier DR (1976) Iterative methods for determining the k shortest paths in a network. Networks 6: 205\u2013230","journal-title":"Networks"},{"issue":"4","key":"140_CR19","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0305-0548(98)00070-7","volume":"26","author":"ES Poort van der","year":"1999","unstructured":"van der Poort ES, Libura M, Sierksma G, van der Veen JAA (1999) Solving the k-best travelling salesman problem. Comp Oper Res 26(4): 409\u2013425","journal-title":"Comp Oper Res"},{"key":"140_CR20","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the k shortest loopless paths in a network. Manage Sci 17: 712\u2013716","journal-title":"Manage Sci"},{"issue":"3","key":"140_CR21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/trsc.30.3.181","volume":"30","author":"PJ Zwaneveld","year":"1996","unstructured":"Zwaneveld PJ, Kroon LG, Romeijn HE, Salomon M, Dauz\u00e8re-P\u00e9r\u00e8s S, van Hoesel SPM, Ambergen HW (1996) Routing trains through railway stations: model formulation and algorithms. Transp Sci 30(3): 181\u2013194","journal-title":"Transp Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-008-0140-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T17:44:30Z","timestamp":1557596670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-008-0140-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,29]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s00291-008-0140-9","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,29]]}}}