{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:20:52Z","timestamp":1760646052584,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385155"},{"type":"electronic","value":"9783642385162"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38516-2_8","type":"book-chapter","created":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T03:10:01Z","timestamp":1368673801000},"page":"92-106","source":"Crossref","is-referenced-by-count":9,"title":["Experimental Analysis of Pheromone-Based Heuristic Column Generation Using irace"],"prefix":"10.1007","author":[{"given":"Florence","family":"Massen","sequence":"first","affiliation":[]},{"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-75514-2_9","volume-title":"Hybrid Metaheuristics","author":"P. Balaprakash","year":"2007","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T.: Improvement strategies for the F-race algorithm: Sampling design and iterative refinement. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HM 2007. LNCS, vol.\u00a04771, pp. 108\u2013122. Springer, Heidelberg (2007)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Birattari, M.: Tuning Metaheuristics: A Machine Learning Perspective. SCI, vol.\u00a0197. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00483-4_7"},{"issue":"9","key":"8_CR3","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1016\/j.cor.2011.11.008","volume":"39","author":"A. Bortfeldt","year":"2012","unstructured":"Bortfeldt, A.: A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comp. & Op. Res.\u00a039(9), 2248\u20132257 (2012)","journal-title":"Comp. & Op. Res."},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1002\/net.20179","volume":"49","author":"K.F. Doerner","year":"2007","unstructured":"Doerner, K.F., Fuellerer, G., Hartl, R.F., Gronalt, M., Iori, M.: Metaheuristics for the vehicle routing problem with loading constraints. Networks\u00a049(4), 294\u2013307 (2007)","journal-title":"Networks"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2009.03.046","volume":"201","author":"G. Fuellerer","year":"2010","unstructured":"Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M.: Metaheuristics for vehicle routing problems with three-dimensional loading constraints. EJOR\u00a0201(3), 751\u2013759 (2010)","journal-title":"EJOR"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"40","author":"M. Gendreau","year":"2006","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Trans. Sci.\u00a040(3), 342\u2013350 (2006)","journal-title":"Trans. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F. Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research\u00a036, 267\u2013306 (2009)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M. Iori","year":"2010","unstructured":"Iori, M., Martello, S.: Routing problems with loading constraints. TOP\u00a018, 4\u201327 (2010)","journal-title":"TOP"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Tech. Rep. TR\/IRIDIA\/2011-004, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium (2011)","DOI":"10.32614\/CRAN.package.irace"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-29828-8_17","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"F. Massen","year":"2012","unstructured":"Massen, F., Deville, Y., Van Hentenryck, P.: Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol.\u00a07298, pp. 260\u2013274. Springer, Heidelberg (2012)"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1100.0328","volume":"44","author":"E. Prescott-Gagnon","year":"2010","unstructured":"Prescott-Gagnon, E., Desaulniers, G., Drexl, M., Rousseau, L.M.: European driver rules in vehicle routing with time windows. Trans. Sci.\u00a044(4), 455\u2013473 (2010)","journal-title":"Trans. Sci."},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M. Reimann","year":"2004","unstructured":"Reimann, M., Doerner, K., Hartl, R.F.: D-ants: Savings based ants divide and conquer the vehicle routing problem. Comp. & Op. Res.\u00a031(4), 563\u2013591 (2004)","journal-title":"Comp. & Op. Res."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Ren, J., Tian, Y., Sawaragi, T.: A relaxation method for the three-dimensional loading capacitated vehicle routing problem. In: 2011 IEEE\/SICE International Symposium on System Integration (SII), pp. 750\u2013755. IEEE (2011)","DOI":"10.1109\/SII.2011.6147542"},{"key":"8_CR15","unstructured":"Ruan, Q., Zhang, Z., Miao, L., Shen, H.: A hybrid approach for the vehicle routing problem with three-dimensional loading constraints. Comp. & Op. Res. (2011)"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/TITS.2009.2020187","volume":"10","author":"C. Tarantilis","year":"2009","unstructured":"Tarantilis, C., Zachariadis, E., Kiranoudis, C.: A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems\u00a010(2), 255\u2013271 (2009)","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002)","DOI":"10.1137\/1.9780898718515"},{"issue":"4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/s00291-009-0179-2","volume":"33","author":"F. Tricoire","year":"2011","unstructured":"Tricoire, F., Doerner, K.F., Hartl, R.F., Iori, M.: Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectrum\u00a033(4), 931\u2013959 (2011)","journal-title":"OR Spectrum"},{"key":"8_CR19","unstructured":"Benchmark instances for the 3L-CVRP, http:\/\/www.or.deis.unibo.it\/research.html"},{"key":"8_CR20","unstructured":"Benchmark instances for the MPVRP, http:\/\/prolog.univie.ac.at\/research\/VRPandBPP\/"},{"key":"8_CR21","unstructured":"Supp. material, http:\/\/becool.info.ucl.ac.be\/resources\/ACO-HCG-IRACE"},{"issue":"9","key":"8_CR22","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1016\/j.cor.2011.11.001","volume":"39","author":"W. Zhu","year":"2012","unstructured":"Zhu, W., Qin, H., Lim, A., Wang, L.: A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. Comp. & Op. Res.\u00a039(9), 2178\u20132195 (2012)","journal-title":"Comp. & Op. Res."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38516-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:18:35Z","timestamp":1746008315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38516-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385155","9783642385162"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38516-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}