{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:22:54Z","timestamp":1774282974440,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:00:00Z","timestamp":1579305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:00:00Z","timestamp":1579305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["310393\/2015-9"],"award-info":[{"award-number":["310393\/2015-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11590-019-01530-w","type":"journal-article","created":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T16:02:36Z","timestamp":1579363356000},"page":"79-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows"],"prefix":"10.1007","volume":"16","author":[{"given":"Eduardo Theodoro","family":"Bogue","sequence":"first","affiliation":[]},{"given":"Huggo Silva","family":"Ferreira","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6831-2006","authenticated-orcid":false,"given":"Thiago F.","family":"Noronha","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Prins","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,18]]},"reference":[{"issue":"6","key":"1530_CR1","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"HMB Amor","year":"2009","unstructured":"Amor, H.M.B., Desrosiers, J., Frangioni, A.: On the choice of explicit stabilizing terms in column generation. Discrete Appl. Math. 157(6), 1167\u20131184 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1530_CR2","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res."},{"key":"1530_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cor.2013.08.010","volume":"52","author":"S Belhaiza","year":"2014","unstructured":"Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52, 269\u2013281 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"1530_CR4","doi-asserted-by":"publisher","first-page":"2972","DOI":"10.1016\/j.cor.2005.02.029","volume":"33","author":"A Chabrier","year":"2006","unstructured":"Chabrier, A.: Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10), 2972\u20132990 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1530_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"1530_CR6","volume-title":"Column Generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation, vol. 5. Springer, Berlin (2006)"},{"issue":"2","key":"1530_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1080\/09720502.2007.10700491","volume":"10","author":"D Favaretto","year":"2007","unstructured":"Favaretto, D., Moretti, E., Pellegrini, P.: Ant colony system for a vrp with multiple time windows and multiple visits. J. Interdiscip. Math. 10(2), 263\u2013284 (2007)","journal-title":"J. Interdiscip. Math."},{"key":"1530_CR8","doi-asserted-by":"crossref","unstructured":"Ferreira, H.S., Bogue, E.T., Noronha, T.F., Belhaiza, S., Prins, C.: Variable neighborhood search for vehicle routing problem with multiple time windows. In 5th International Conference on Variable Neighborhood Search. Electron. Notes Discrete Math. 66, 207\u2013214 (2018)","DOI":"10.1016\/j.endm.2018.03.027"},{"key":"1530_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.trpro.2016.02.061","volume":"12","author":"P Gianessi","year":"2016","unstructured":"Gianessi, P., Alfandari, L., L\u00e9tocart, L., Calvo, R.W.: A column generation based heuristic for the multicommodity-ring vehicle routing problem. Transp. Res. Procedia 12, 227\u2013238 (2016)","journal-title":"Transp. Res. Procedia"},{"key":"1530_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"2","key":"1530_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"1530_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M Monaci","year":"2006","unstructured":"Monaci, M., Toth, P.: A set-covering-based heuristic approach for bin-packing problems. INFORMS J. Comput. 18, 71\u201385 (2006). https:\/\/doi.org\/10.1287\/ijoc.1040.0089","journal-title":"INFORMS J. Comput."},{"issue":"16","key":"1530_CR13","doi-asserted-by":"publisher","first-page":"7495","DOI":"10.1016\/j.eswa.2014.06.010","volume":"41","author":"VWC Morais","year":"2014","unstructured":"Morais, V.W.C., Mateus, G.R., Noronha, T.F.: Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Syst. Appl. 41(16), 7495\u20137506 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2014.06.010","journal-title":"Expert Syst. Appl."},{"key":"1530_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2015.06.014","volume":"65","author":"K Sinclair","year":"2016","unstructured":"Sinclair, K., Cordeau, J.F., Laporte, G.: A column generation post-optimization heuristic for the integrated aircraft and passenger recovery problem. Comput. Oper. Res. 65, 42\u201352 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1530_CR15","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"1530_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1038\/nmeth.2811","volume":"11","author":"M Spitzer","year":"2014","unstructured":"Spitzer, M., Wildenhain, J., Rappsilber, J., Tyers, M.: Boxplotr: a web tool for generation of box plots. Nat. Methods 11(2), 121 (2014)","journal-title":"Nat. Methods"},{"issue":"1","key":"1530_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"\u00c9D Taillard","year":"1999","unstructured":"Taillard, \u00c9.D.: A heuristic column generation method for the heterogeneous fleet vrp. RAIRO Oper. Res. 33(1), 1\u201314 (1999)","journal-title":"RAIRO Oper. Res."},{"issue":"3","key":"1530_CR18","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.ejor.2013.05.024","volume":"236","author":"D Ta\u015f","year":"2014","unstructured":"Ta\u015f, D., Gendreau, M., Dellaert, N., Woensel, T.V., Kok, A.D.: Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach. Eur. J. Oper. Res. 236(3), 789\u2013799 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"1530_CR19","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/j.omega.2011.01.003","volume":"39","author":"H Tempelmeier","year":"2011","unstructured":"Tempelmeier, H.: A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint. Omega 39(6), 627\u2013633 (2011)","journal-title":"Omega"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01530-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-019-01530-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-019-01530-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T11:39:37Z","timestamp":1641814777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-019-01530-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,18]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1530"],"URL":"https:\/\/doi.org\/10.1007\/s11590-019-01530-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,18]]},"assertion":[{"value":"31 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}