{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:22:04Z","timestamp":1772842924477,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,24]],"date-time":"2008-05-24T00:00:00Z","timestamp":1211587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10732-008-9081-3","type":"journal-article","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T16:52:32Z","timestamp":1211561552000},"page":"1-22","source":"Crossref","is-referenced-by-count":85,"title":["Neighborhood structures for the container loading problem: a\u00a0VNS\u00a0implementation"],"prefix":"10.1007","volume":"16","author":[{"given":"F.","family":"Parre\u00f1o","sequence":"first","affiliation":[]},{"given":"R.","family":"Alvarez-Valdes","sequence":"additional","affiliation":[]},{"given":"J. F.","family":"Oliveira","sequence":"additional","affiliation":[]},{"given":"J. M.","family":"Tamarit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,24]]},"reference":[{"key":"9081_CR1","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1016\/j.ejor.2004.04.037","volume":"168","author":"E.E. Bischoff","year":"2006","unstructured":"Bischoff, E.E.: Three dimensional packing of items with limited loading bearing strength. Eur. J. Oper. Res. 168, 952\u2013966 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(90)90362-F","volume":"44","author":"E.E. Bischoff","year":"1990","unstructured":"Bischoff, E.E., Marriot, M.D.: A comparative evaluation of heuristics for container loading. Eur. J. Oper. Res. 44, 267\u2013276 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","volume":"23","author":"E.E. Bischoff","year":"1995","unstructured":"Bischoff, E.E., Ratcliff, M.S.W.: Issues in the development of approaches to container loading. Omega 23, 377\u2013390 (1995)","journal-title":"Omega"},{"key":"9081_CR4","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/0377-2217(95)00031-K","volume":"84","author":"E.E. Bischoff","year":"1995","unstructured":"Bischoff, E.E., Janetz, F., Ratcliff, M.S.W.: Loading pallets with nonidentical items. Eur. J. Oper. Res. 84, 681\u2013692 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR5","first-page":"237","volume":"20","author":"A. Bortfeldt","year":"1998","unstructured":"Bortfeldt, A., Gehring, H.: A tabu search algorithm for weakly heterogeneous container loading problems. OR Spectr. 20, 237\u2013250 (1998)","journal-title":"OR Spectr."},{"key":"9081_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","volume":"131","author":"A. Bortfeldt","year":"2001","unstructured":"Bortfeldt, A., Gehring, H.: A hybrid genetic algorithm for the container loading problem. Eur. J. Oper. Res. 131, 143\u2013161 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR7","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0167-8191(03)00047-4","volume":"29","author":"A. Bortfeldt","year":"2003","unstructured":"Bortfeldt, A., Gehring, H., Mack, D.: A parallel tabu search algorithm for solving the container loading problem. Parallel Comput. 29, 641\u2013662 (2003)","journal-title":"Parallel Comput."},{"key":"9081_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejor.2004.07.061","volume":"171","author":"J. Brimberg","year":"2006","unstructured":"Brimberg, J., Uro\u0161evic, D., Mladenovic, N.: Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur. J. Oper. Res. 171, 74\u201384 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR9","unstructured":"Davies, A.P., Bischoff, E.E.: Weight distribution considerations in container loading. Working Paper, European Business Management School, Statistics and OR Group, University of Wales, Swansea (1998)"},{"key":"9081_CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(02)00133-9","volume":"141","author":"M. Eley","year":"2002","unstructured":"Eley, M.: Solving container loading problems by block arrangement. Eur. J. Oper. Res. 141, 393\u2013409 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR11","doi-asserted-by":"crossref","first-page":"1381","DOI":"10.1023\/A:1015013919497","volume":"8","author":"F. Garc\u00eda-L\u00f3pez","year":"2002","unstructured":"Garc\u00eda-L\u00f3pez, F., Meli\u00e1n-Batista, B., Moreno-P\u00e9rez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. J. Heur. 8, 1381\u20131231 (2002)","journal-title":"J. Heur."},{"key":"9081_CR12","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. Freeman, San Fracisco (1979)"},{"key":"9081_CR13","doi-asserted-by":"crossref","unstructured":"Gavranovic, H.: Local search and suffix tree for car-sequencing problem with colors. Eur. J. Oper. Res. (2008, in press)","DOI":"10.1016\/j.ejor.2007.04.051"},{"key":"9081_CR14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","volume":"4","author":"H. Gehring","year":"1997","unstructured":"Gehring, H., Bortfeldt, A.: A genetic algorithm for solving the container loading problem. Int. Trans. Oper. Res. 4, 401\u2013418 (1997)","journal-title":"Int. Trans. Oper. Res."},{"key":"9081_CR15","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1111\/1475-3995.00369","volume":"9","author":"H. Gehring","year":"2002","unstructured":"Gehring, H., Bortfeldt, A.: A parallel genetic algorithm for solving the container loading problem. Int. Trans. Oper. Res. 9, 497\u2013511 (2002)","journal-title":"Int. Trans. Oper. Res."},{"key":"9081_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0305-0548(80)90001-5","volume":"7","author":"J.A. George","year":"1980","unstructured":"George, J.A., Robinson, D.F.: A heuristic for packing boxes into a container. Comput. Oper. Res. 7, 147\u2013156 (1980)","journal-title":"Comput. Oper. Res."},{"key":"9081_CR17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/0-387-28356-0_8","volume-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","author":"P. Hansen","year":"2005","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Burke, E., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 211\u2013238. Springer, Berlin (2005)"},{"key":"9081_CR18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R. Kolisch","year":"2006","unstructured":"Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174, 23\u201337 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR19","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J. Kyt\u00f6jokia","year":"2007","unstructured":"Kyt\u00f6jokia, J., Nuortiob, T., Br\u00e4ysy, O., M, Gendreau.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput. Oper. Res. 34, 2743\u20132757 (2007)","journal-title":"Comput. Oper. Res."},{"key":"9081_CR20","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1111\/j.1475-3995.2004.00474.x","volume":"11","author":"D. Mack","year":"2004","unstructured":"Mack, D., Bortfeldt, A., Gehring, H.: A parallel hybrid local search algorithm for the container loading problem. Int. Trans. Oper. Res. 11, 511\u2013533 (2004)","journal-title":"Int. Trans. Oper. Res."},{"key":"9081_CR21","doi-asserted-by":"crossref","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. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9081_CR22","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MIS.2005.57","volume":"20","author":"A. Moura","year":"2005","unstructured":"Moura, A., Oliveira, J.F.: A GRASP approach to the container-loading problem. IEEE Intell. Syst. 20, 50\u201357 (2005)","journal-title":"IEEE Intell. Syst."},{"key":"9081_CR23","doi-asserted-by":"crossref","unstructured":"Parre\u00f1o, F., Alvarez-Valdes, R., Oliveira, J.F., Tamarit, J.M.: A maximal-space algorithm for the container loading problem. INFORMS J. Comput. (2008, in press)","DOI":"10.1287\/ijoc.1070.0254"},{"key":"9081_CR24","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0377-2217(02)00132-7","volume":"141","author":"D. Pisinger","year":"2002","unstructured":"Pisinger, D.: Heuristics for the container loading problem. Eur. J. Oper. Res. 141, 382\u2013392 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9081_CR25","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G. W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Haussner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109\u20131130 (2007)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9081-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-008-9081-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-008-9081-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:29Z","timestamp":1559256869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-008-9081-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,24]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9081"],"URL":"https:\/\/doi.org\/10.1007\/s10732-008-9081-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,24]]}}}