{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T20:52:20Z","timestamp":1761339140036,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160530"},{"type":"electronic","value":"9783642160547"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_12","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T22:07:50Z","timestamp":1285884470000},"page":"160-173","source":"Crossref","is-referenced-by-count":12,"title":["On Index Structures in Hybrid Metaheuristics for Routing Problems with Hard Feasibility Checks: An Application to the 2-Dimensional Loading Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Strodl","sequence":"first","affiliation":[]},{"given":"Karl F.","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Fabien","family":"Tricoire","sequence":"additional","affiliation":[]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico, M., Martello, S., Vigo, D.: A lower bound for the non-oriented two-dimensional bin packing problem. Discrete Applied Mathematics 118 (2002)","key":"12_CR1","DOI":"10.1016\/S0166-218X(01)00253-0"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research\u00a012, 568\u2013581 (1964)","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Deppisch, U.: S-tree: a dynamic balanced signature index for office retrieval. In: SIGIR 1986: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, New York, pp. 77\u201387 (1986)","key":"12_CR3","DOI":"10.1145\/253168.253189"},{"unstructured":"Fuellerer, G., Doerner, K., Hartl, F., Iori, M.: Ant colony optimization for the two-dimensional loading vehicle routing problem. Computer and Operations Research (2007)","key":"12_CR4"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1002\/net.20192","volume":"51","author":"M. Gendreau","year":"2008","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks\u00a051(1), 4\u201318 (2008)","journal-title":"Networks"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research\u00a0130, 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"unstructured":"Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. Technical Report 19\/01, University of Mannheim (2001)","key":"12_CR7"},{"doi-asserted-by":"crossref","unstructured":"Helmer, S., Neumann, T., Moerkotte, G.: A robust scheme for multilevel extendible hashing. In: Proceedings of the 18th International Symposium on Computer and Information Sciences (IS-CIS 2003), Antalya, pp. 220\u2013227 (2003)","key":"12_CR8","DOI":"10.1007\/978-3-540-39737-3_28"},{"unstructured":"Helmer, S., Aly, R., Neumann, T., Moerkotte, G.: Indexing Set-Valued Attributes with a Multi-Level-Extendible Hashing Scheme (2007)","key":"12_CR9"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M. Iori","year":"2007","unstructured":"Iori, M., Salazar, G., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science\u00a041(2), 253\u2013264 (2007)","journal-title":"Transportation Science"},{"doi-asserted-by":"crossref","unstructured":"Lodi, A., Martello, S., Vigo, D.: Heuristic and Metaheuristic Approches for a Class of Two-Dimensional Bin Packing Problems. INFORMS Journal on Computing\u00a011(4) (Fall 1999)","key":"12_CR11","DOI":"10.1287\/ijoc.11.4.345"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/mnsc.44.3.388","volume":"44","author":"S. Martello","year":"1998","unstructured":"Martello, S., Vigo, D.: Exact Solution of the Two-Dimensional Finite Bin Packing Problem. Management Science\u00a044(3), 388\u2013399 (1998)","journal-title":"Management Science"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Computer and Operations Research\u00a024, 1097 (1997)","journal-title":"Computer and Operations Research"},{"key":"12_CR14","volume-title":"In Proceedings of the 1st Bangalore Annual Compute Conference, COMPUTE 2008","author":"S.I. Elizabeth","year":"2008","unstructured":"Elizabeth, S.I., Izaaz, Y., Nadarajan, R.: On the SD-tree construction for optimal signature operations. In: In Proceedings of the 1st Bangalore Annual Compute Conference, COMPUTE 2008, Bangalore, India, January 18-20. ACM, New York (2008)"},{"unstructured":"SGI: Sandard Template Library Programmer\u2019s Guide, http:\/\/www.sgi.com\/tech\/stl\/index.html","key":"12_CR15"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science\u00a031, 170\u2013186 (1997)","journal-title":"Transportation Science"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0306-4379(01)00047-3","volume":"27","author":"E. Tousidou","year":"2002","unstructured":"Tousidou, E., Bozanis, P., Manolopoulos, Y.: Signature-based structures for objects with set-valued attributes. Inf. Syst.\u00a027(2), 93\u2013121 (2002)","journal-title":"Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and Exact Algorithms for the Multi-Pile Vehicle Routing Problem. OR Spectrum (2010) (available online)","key":"12_CR18","DOI":"10.1007\/s00291-009-0179-2"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T01:00:42Z","timestamp":1559696442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}