{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T22:10:06Z","timestamp":1742767806555,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291234"},{"type":"electronic","value":"9783642291241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_3","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T17:24:42Z","timestamp":1332523482000},"page":"25-36","source":"Crossref","is-referenced-by-count":0,"title":["An ILS-Based Metaheuristic for the Stacker Crane Problem"],"prefix":"10.1007","author":[{"given":"Thais","family":"\u00c1vila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c1ngel","family":"Corber\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isaac","family":"Plana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 M.","family":"Sanchis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1287\/trsc.1090.0305","volume":"44","author":"J.M. Belenguer","year":"2010","unstructured":"Belenguer, J.M., Benavent, E., Labadi, N., Prins, C., Reghioui, M.: Split Delivery Capacitated Arc Routing Problem: Lower Bound and Metaheuristic. Transportation Science\u00a044, 206\u2013220 (2010)","journal-title":"Transportation Science"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10287-009-0119-2","volume":"7","author":"E. Benavent","year":"2010","unstructured":"Benavent, E., Corber\u00e1n, A., Sanchis, J.M.: A metaheuristic for the min\u2212max windy rural postman problem with K vehicles. Computational Management Science\u00a07, 269\u2013287 (2010)","journal-title":"Computational Management Science"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G. Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP\u00a015, 1\u201331 (2007)","journal-title":"TOP"},{"unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Graduate School of Industrial Administration, Carnegie Mellon University (1976)","key":"3_CR4"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-44808-X_3","volume-title":"Algorithm Engineering and Experimentation","author":"J. Cirasella","year":"2001","unstructured":"Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol.\u00a02153, pp. 32\u201359. Springer, Heidelberg (2001)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc Routing Problems, Part II: The Rural Postman Problem. Operations Research\u00a043, 399\u2013414 (1995)","journal-title":"Operations Research"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Aproximation Algorithms for some routing problems. SIAM Journal on Computing\u00a07, 178\u2013193 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR8","first-page":"237","volume":"1","author":"M. Guan","year":"1962","unstructured":"Guan, M.: Graphic programming using odd or even points. Chinese Mathematics\u00a01, 237\u2013277 (1962)","journal-title":"Chinese Mathematics"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jagm.2001.1187","volume":"41","author":"R. Hassin","year":"2001","unstructured":"Hassin, R., Khuller, S.: z-Approximations. Journal of Algorithms\u00a041, 429\u2013442 (2001)","journal-title":"Journal of Algorithms"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/ijoc.11.1.53","volume":"11","author":"A. Hertz","year":"1999","unstructured":"Hertz, A., Laporte, G., Nachen-Hugo, P.: Improvement procedures for the undirected rural postman problem. INFORMS Journal on Computing\u00a011, 53\u201362 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/S0305-0548(97)00013-0","volume":"24","author":"G. Laporte","year":"1997","unstructured":"Laporte, G.: Modeling and solving several classes of arc routing problems as traveling salesman problems. Computers & Operations Research\u00a024, 1057\u20131061 (1997)","journal-title":"Computers & Operations Research"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problem. Networks\u00a06, 273\u2013280 (1976)","journal-title":"Networks"},{"unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353 (2002)","key":"3_CR13"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"C.S. Orloff","year":"1974","unstructured":"Orloff, C.S.: A fundamental problem in vehicle routing. Networks\u00a04, 35\u201364 (1974)","journal-title":"Networks"},{"unstructured":"Srour, F.J.: Dissecting drayage: an examination if structure, information, and control in drayage operations. ERIM Ph.D. Series reseaarch in management, Erasmus Research Institute in Management, 1786 (2010) ISBN978-90-5892-226-7","key":"3_CR16"},{"doi-asserted-by":"crossref","unstructured":"Srour, F.J., van de Velde, S.: Are stacker crane problems easy? A statistical study. Computers & Operations Research (2011) doi:10.1016\/j.cor.2011.06.017","key":"3_CR17","DOI":"10.1016\/j.cor.2011.06.017"},{"doi-asserted-by":"crossref","unstructured":"Zhang, L.: Simple Heuristics for some variants on the traveling salesman problem. In: IEEE International Conference on Systems, Man and Cybernetics, vol.\u00a02, pp. 1175\u20131178 (1992)","key":"3_CR18","DOI":"10.1109\/ICSMC.1992.271629"},{"doi-asserted-by":"crossref","unstructured":"Zhang, L., Zheng, W.: Genetic coding for solving both the stacker crane problem and its k-variant. In: IEEE International Conference on Systems, Man and Cybernetics 1995, pp. 1061\u20131066 (1995)","key":"3_CR19","DOI":"10.1109\/ICSMC.1995.537910"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T21:43:48Z","timestamp":1742766228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}