{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:00:28Z","timestamp":1740153628742,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T00:00:00Z","timestamp":1492819200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s12293-017-0231-8","type":"journal-article","created":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T02:38:41Z","timestamp":1492828721000},"page":"307-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9205-7391","authenticated-orcid":false,"given":"Mohamed","family":"Barkaoui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,22]]},"reference":[{"issue":"7","key":"231_CR1","doi-asserted-by":"crossref","first-page":"1766","DOI":"10.1016\/j.cor.2013.01.022","volume":"40","author":"M Barkaoui","year":"2013","unstructured":"Barkaoui M, Gendreau M (2013) An adaptive evolutionary approach for real-time vehicle routing and dispatching. J Comput Oper Res 40(7):1766\u20131776","journal-title":"J Comput Oper Res"},{"key":"231_CR2","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.1040.0124","volume":"52","author":"R Bent","year":"2004","unstructured":"Bent R, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52:977\u2013987","journal-title":"Oper Res"},{"key":"231_CR3","unstructured":"Bent R, Van Hentenryck P (2007) Waiting and relocation strategies in online stochastic vehicle routing. In: International joint conference on artificial intelligence, pp 1816\u20131821"},{"issue":"3","key":"231_CR4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/trsc.1040.0095","volume":"39","author":"J Branke","year":"2005","unstructured":"Branke J, Middendorf M, Noeth G, Dessouky M (2005) Waiting strategies for dynamic vehicle routing. Transp Sci INFORMS 39(3):298\u2013312","journal-title":"Transp Sci INFORMS"},{"issue":"4","key":"231_CR5","first-page":"255","volume":"36","author":"R Dondo","year":"2006","unstructured":"Dondo R, Cerda J (2006) An MILP framework for dynamic vehicle routing problems with time windows. Lat Am Appl Res 36(4):255\u2013261","journal-title":"Lat Am Appl Res"},{"issue":"4","key":"231_CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin J-Y, Taillard \u00c9D (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381\u2013390","journal-title":"Transp Sci"},{"issue":"4","key":"231_CR7","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1287\/trsc.2016.0709","volume":"50","author":"M Gendreau","year":"2016","unstructured":"Gendreau M, Jabali O, Rei W (2016) 50th anniversary invited article\u2014future research directions in stochastic vehicle routing. Transp Sci 50(4):1163\u20131173","journal-title":"Transp Sci"},{"key":"231_CR8","first-page":"233","volume":"5","author":"G Ghiani","year":"2008","unstructured":"Ghiani G, Laporte G, Manni E, Musmanno R (2008) Waiting strategies for the dynamic and stochastic traveling salesman problem. Int J Oper Res 5:233\u2013241","journal-title":"Int J Oper Res"},{"key":"231_CR9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tre.2008.08.003","volume":"45","author":"G Ghiani","year":"2009","unstructured":"Ghiani G, Manni E, Quaranta A, Triki C (2009) Anticipatory algorithms for same-day courier dispatching. Transp Res Part E 45:96\u2013106","journal-title":"Transp Res Part E"},{"issue":"4","key":"231_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1006504901164","volume":"12","author":"F Herrera","year":"1998","unstructured":"Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif Intell Rev 12(4):265\u2013319","journal-title":"Artif Intell Rev"},{"issue":"4","key":"231_CR11","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1287\/trsc.1060.0166","volume":"40","author":"LM Hvattum","year":"2006","unstructured":"Hvattum LM, L\u00f8kketangen A, Laporte G (2006) Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transp Sci 40(4):421\u2013438","journal-title":"Transp Sci"},{"key":"231_CR12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1287\/trsc.1050.0114","volume":"40","author":"S Ichoua","year":"2006","unstructured":"Ichoua S, Gendreau M, Potvin JY (2006) Exploiting knowledge about future demands for real-time vehicle dispatching. Transp Sci 40:211\u2013225","journal-title":"Transp Sci"},{"key":"231_CR13","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1057\/palgrave.jors.2601352","volume":"53","author":"A Larsen","year":"2002","unstructured":"Larsen A, Madsen O, Solomon MM (2002) Partially dynamic vehicle routing\u2014models and algorithms. J Oper Res Soc 53:637\u2013646","journal-title":"J Oper Res Soc"},{"key":"231_CR14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1287\/trsc.1030.0070","volume":"38","author":"A Larsen","year":"2004","unstructured":"Larsen A, Madsen OBG, Solomon MM (2004) The a priori dynamic traveling salesman problem with time windows. Transp Sci 38:459\u2013472","journal-title":"Transp Sci"},{"key":"231_CR15","doi-asserted-by":"publisher","unstructured":"Li H, Wang L, Hei X, Li W, Jiang Q (2017) A decomposition-based chemical reaction optimization for multi-objective vehicle routing problem for simultaneous delivery and pickup with time windows. Memet Comput. doi: 10.1007\/s12293-016-0222-1","DOI":"10.1007\/s12293-016-0222-1"},{"key":"231_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0505-4","volume-title":"Anticipatory optimization for dynamic decision making volume 51 of operations research\/computer science interfaces series","author":"S Meisel","year":"2011","unstructured":"Meisel S (2011) Anticipatory optimization for dynamic decision making volume 51 of operations research\/computer science interfaces series. Springer, New York"},{"key":"231_CR17","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S Mitrovic-Minic","year":"2004","unstructured":"Mitrovic-Minic S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transp Res Part B 38:669\u2013685","journal-title":"Transp Res Part B"},{"key":"231_CR18","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S Mitrovic-Minic","year":"2004","unstructured":"Mitrovic-Minic S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp Res Part B 38:635\u2013655","journal-title":"Transp Res Part B"},{"issue":"1","key":"231_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1\u201311","journal-title":"Eur J Oper Res"},{"key":"231_CR20","first-page":"165","volume":"46","author":"V Pureza","year":"2008","unstructured":"Pureza V, Laporte G (2008) Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows. INFOR 46:165\u2013175","journal-title":"INFOR"},{"issue":"3","key":"231_CR21","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/trsc.1060.0183","volume":"41","author":"BW Thomas","year":"2007","unstructured":"Thomas BW (2007) Waiting strategies for anticipating service requests from known customer locations. Transp Sci 41(3):319\u2013331","journal-title":"Transp Sci"},{"issue":"4","key":"231_CR22","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s12293-012-0095-x","volume":"4","author":"A Tonda","year":"2012","unstructured":"Tonda A, Lutton E, Squillero G (2012) A benchmark for cooperative coevolution. Memet Comput 4(4):263\u2013277","journal-title":"Memet Comput"},{"key":"231_CR23","doi-asserted-by":"crossref","unstructured":"Ulmer MW, Mattfeld DC, K\u00f6ster F (2015a) Budgeting time for dynamic vehicle routing with stochastic customer requests, (Working paper)","DOI":"10.1007\/978-3-319-20863-3_16"},{"key":"231_CR24","doi-asserted-by":"crossref","unstructured":"Ulmer MW, Mattfeld DC, Hennig M, Goodson JC (2015b) A rollout algorithm for vehicle routing with stochastic customer requests, logistics management, Mattfeld DC, Spengler TS, Brinkmann J, Grunewald M (Eds.), Lecture notes in logistics (LNL), Springer","DOI":"10.1007\/978-3-319-20863-3_16"},{"key":"231_CR25","doi-asserted-by":"crossref","unstructured":"Van Hemert JI, La Poutr\u00e9 JA (2004) Dynamic routing with fruitful regions: models and evolutionary computation. Yao X, Burke E, Lozano JA, Smith J, Merelo-Guervos JJ, Bullinaria JA, Rowe J, Tino P, Kabaan A, Schwefel HP, (eds.) Parallel problem solving from nature VIII, Springer-Verlag, 690\u2013699","DOI":"10.1007\/978-3-540-30217-9_70"},{"key":"231_CR26","first-page":"1147","volume":"4490","author":"J-Q Wang","year":"2007","unstructured":"Wang J-Q, Tong X-N, Li Z-M (2007) An improved evolutionary algorithm for dynamic vehicle routing problem with time windows. Comput Sci ICCS 4490:1147\u20131154","journal-title":"Comput Sci ICCS"},{"issue":"1","key":"231_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12293-008-0003-6","volume":"1","author":"X Yu","year":"2009","unstructured":"Yu X, Tang K, Chen T, Yao X (2009) Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Memet Comput 1(1):3\u201324","journal-title":"Memet Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-017-0231-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-017-0231-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-017-0231-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T12:12:42Z","timestamp":1569067962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-017-0231-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,22]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["231"],"URL":"https:\/\/doi.org\/10.1007\/s12293-017-0231-8","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2017,4,22]]}}}