{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T20:54:50Z","timestamp":1761339290654},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642371974"},{"type":"electronic","value":"9783642371981"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37198-1_20","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T03:03:05Z","timestamp":1362452585000},"page":"226-237","source":"Crossref","is-referenced-by-count":2,"title":["Single Line Train Scheduling with ACO"],"prefix":"10.1007","author":[{"given":"Marc","family":"Reimann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose Eugenio","family":"Leal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a034, 1161\u20131172 (2004)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"20_CR2","unstructured":"Burdett, R.L., Kozan, E.: A disjunctive graph model and framework for constructing new train schedules. European Journal of Operational Research (to appear)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/0305-0548(94)90099-X","volume":"21","author":"X. Cai","year":"1994","unstructured":"Cai, X., Goh, C.J.: A fast heuristic for the train scheduling problem. Computers and Operations Research\u00a021, 499\u2013510 (1994)","journal-title":"Computers and Operations Research"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1016\/j.dam.2005.05.026","volume":"154","author":"A. Caprara","year":"2006","unstructured":"Caprara, A., Monaci, M., Toth, P., Guida, P.L.: A lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics\u00a0154, 738\u2013753 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1057\/jors.1995.136","volume":"46","author":"M. Carey","year":"1995","unstructured":"Carey, M., Lockwood, D.: A model, algorithms and strategy for train pathing. Journal of the Operational Research Society\u00a046, 988\u20131005 (1995)","journal-title":"Journal of the Operational Research Society"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.ejor.2006.10.034","volume":"183","author":"A. D\u2019Ariano","year":"2007","unstructured":"D\u2019Ariano, A., Pacciarelli, D., Pranzo, M.: A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research\u00a0183, 643\u2013657 (2007)","journal-title":"European Journal of Operational Research"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a026, 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"20_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press\/Bradford Books, Cambridge, MA (2004)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"W.J. Gutjahr","year":"2000","unstructured":"Gutjahr, W.J.: A graph-based ant system and its convergence. Future Generation Computing Systems\u00a016, 873\u2013888 (2000)","journal-title":"Future Generation Computing Systems"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"W.J. Gutjahr","year":"2002","unstructured":"Gutjahr, W.J.: ACO algorithms with guaranteed convergence to the optimal solution. Information Processing Letters\u00a082, 145\u2013153 (2002)","journal-title":"Information Processing Letters"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0191-2615(95)00022-4","volume":"30","author":"A. Higgins","year":"1996","unstructured":"Higgins, A., Kozan, E., Ferreira, L.: Optimal scheduling of trains on a single line track. Transportation Research B\u00a030, 147\u2013161 (1996)","journal-title":"Transportation Research B"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1009672832658","volume":"3","author":"A. Higgins","year":"1997","unstructured":"Higgins, A., Kozan, E., Ferreira, L.: Heuristic techniques for single line train scheduling. Journal of Heuristics\u00a03, 43\u201362 (1997)","journal-title":"Journal of Heuristics"},{"key":"20_CR13","unstructured":"Leal, J.E.: A heuristic approach to the problem of scheduling trains on single lines. Working paper, Department of Industrial Engineering, PUC-Rio (2008)"},{"key":"20_CR14","series-title":"Lecture Notes in Artificial Intelligence","first-page":"371","volume-title":"Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving","author":"E. Oliveira","year":"2001","unstructured":"Oliveira, E., Smith, B.M.: A Combined Constraint-Based Search Method for Single-Track Railway Scheduling Problem. In: Brazdil, P., Jorge, A. (eds.) EPIA 2001. LNCS (LNAI), vol.\u00a02258, pp. 371\u2013378. Springer, Heidelberg (2001)"},{"key":"20_CR15","unstructured":"Reimann, M.: Combining an Exact Algorithm with an Ant System for Travelling Salesman Problems. Working paper, University of Vienna (2003)"},{"key":"20_CR16","unstructured":"Reimann, M., Leal, J.E.: Single line train scheduling with Ant Colony Optimization. Working paper, University of Graz (2011)"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0191-2615(99)00004-1","volume":"33","author":"I. Sahin","year":"1998","unstructured":"Sahin, I.: Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research B\u00a033, 511\u2013534 (1998)","journal-title":"Transportation Research B"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","volume":"6","author":"T. St\u00fctzle","year":"2002","unstructured":"St\u00fctzle, T., Dorigo, M.: A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation\u00a06, 358\u2013365 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-1-4615-5775-3_22","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"T. St\u00fctzle","year":"1999","unstructured":"St\u00fctzle, T., Hoos, H.: The Max-Min Ant System and Local Search for Combinatorial Optimization Problems. In: Vo\u00df, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 313\u2013329. Kluwer, Boston (1999)"},{"key":"20_CR20","first-page":"343","volume-title":"Proceedings of OR 1972","author":"B. Szpigel","year":"1973","unstructured":"Szpigel, B.: Optimal train scheduling on a single track railway. In: Ross, M. (ed.) Proceedings of OR 1972, pp. 343\u2013352. North-Holland, Amsterdam (1973)"},{"key":"20_CR21","series-title":"SCI","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-78985-7_10","volume-title":"Metaheuristics for Scheduling in Industrial and Manufacturing Applications","author":"P. Tormos","year":"2008","unstructured":"Tormos, P., Lova, A., Barber, F., Ingolotti, L., Abril, M., Salido, M.A.: A Genetic Algorithm for Railway Scheduling Problems. In: Xhafa, F., Abraham, A. (eds.) Metaheuristics for Scheduling in Industrial and Manufacturing Applications. SCI, vol.\u00a0128, pp. 255\u2013276. Springer, Heidelberg (2008)"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1016\/j.ejor.2004.07.019","volume":"167","author":"X. Zhou","year":"2005","unstructured":"Zhou, X., Zhong, M.: Bicriteria train scheduling for high-speed passenger railroad planning applications. European Journal of Operational Research\u00a0167, 752\u2013771 (2005)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37198-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:26:58Z","timestamp":1558315618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37198-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642371974","9783642371981"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37198-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}