{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T08:25:47Z","timestamp":1786091147258,"version":"3.56.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10951-020-00650-x","type":"journal-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T07:03:02Z","timestamp":1592895782000},"page":"711-731","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["A periodic optimization approach to dynamic pickup and delivery problems with time windows"],"prefix":"10.1007","volume":"23","author":[{"given":"Farzaneh","family":"Karami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wim","family":"Vancroonenburg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Greet","family":"Vanden\u00a0Berghe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"issue":"2","key":"650_CR1","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.trc.2008.02.001","volume":"17","author":"E Angelelli","year":"2009","unstructured":"Angelelli, E., Bianchessi, N., Mansini, R., & Speranza, M. G. (2009). Short term strategies for a dynamic multi-period routing problem. Transportation Research Part C: Emerging Technologies, 17(2), 106\u2013119.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"650_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-0-387-71722-7_10","volume-title":"Dynamic Fleet Management","author":"A Attanasio","year":"2007","unstructured":"Attanasio, A., Bregman, J., Ghiani, G., & Manni, E. (2007). Real-time fleet management at ecourier ltd. Dynamic Fleet Management (pp. 219\u2013238). Berlin: Springer."},{"issue":"3","key":"650_CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio, A., Cordeau, J.-F., Ghiani, G., & Laporte, G. (2004). Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing, 30(3), 377\u2013387.","journal-title":"Parallel Computing"},{"key":"650_CR4","volume-title":"Complexity and approximation: Combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"2012","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (2012). Complexity and approximation: Combinatorial optimization problems and their approximability properties. Berlin: Springer."},{"key":"650_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-0-387-71722-7_8","volume-title":"Dynamic Fleet Management","author":"J Barcel\u00f3","year":"2007","unstructured":"Barcel\u00f3, J., Grzybowska, H., & Pardo, S. (2007). Vehicle routing and scheduling models, simulation and city logistics. Dynamic Fleet Management (pp. 163\u2013195). Berlin: Springer."},{"issue":"1","key":"650_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. OR Spectrum, 32(1), 77\u2013107.","journal-title":"OR Spectrum"},{"issue":"4","key":"650_CR7","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R Bent","year":"2006","unstructured":"Bent, R., & Van Hentenryck, P. (2006). A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4), 875\u2013893.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"650_CR8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010). Dynamic pickup and delivery problems. European Journal of Operational Research, 202(1), 8\u201315.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"650_CR9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1287\/ijoc.1110.0454","volume":"24","author":"G Berbeglia","year":"2012","unstructured":"Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2012). A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS Journal on Computing, 24(3), 343\u2013355.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"650_CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/trsc.1100.0336","volume":"45","author":"G Berbeglia","year":"2011","unstructured":"Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2011). Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science, 45(3), 399\u2013412.","journal-title":"Transportation Science"},{"issue":"3","key":"650_CR11","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.ejor.2009.01.046","volume":"200","author":"S Bock","year":"2010","unstructured":"Bock, S. (2010). Real-time control of freight forwarder transportation networks by integrating multimodal transport chains. European Journal of Operational Research, 200(3), 733\u2013746.","journal-title":"European Journal of Operational Research"},{"key":"650_CR12","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"2005","unstructured":"Borodin, A., & El-Yaniv, R. (2005). Online computation and competitive analysis. Cambridge: Cambridge University Press."},{"key":"650_CR13","first-page":"2273","volume":"5","author":"M-S Chang","year":"2003","unstructured":"Chang, M.-S., Chen, S.-R., & Hsueh, C.-F. (2003). Real-time vehicle routing problem with time windows and simultaneous delivery\/pickup demands. Journal of the Eastern Asia Society for Transportation Studies, 5, 2273\u20132286.","journal-title":"Journal of the Eastern Asia Society for Transportation Studies"},{"issue":"2","key":"650_CR14","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.ijpe.2007.10.018","volume":"113","author":"BK-S Cheung","year":"2008","unstructured":"Cheung, B. K.-S., Choy, K., Li, C.-L., Shi, W., & Tang, J. (2008). Dynamic routing model and solution methods for fleet management with mobile technologies. International Journal of Production Economics, 113(2), 694\u2013705.","journal-title":"International Journal of Production Economics"},{"key":"650_CR15","doi-asserted-by":"crossref","unstructured":"Christiaens, J., & Vanden\u00a0Berghe, G. (2020). Slack induction by string removals for vehicle routing problems. Transportation Science (to appear) available as TR, KU Leuven.","DOI":"10.1287\/trsc.2019.0914"},{"issue":"3","key":"650_CR16","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.ejor.2005.02.038","volume":"175","author":"L Coslovich","year":"2006","unstructured":"Coslovich, L., Pesenti, R., & Ukovich, W. (2006). A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research, 175(3), 1605\u20131615.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"650_CR17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s13676-017-0115-6","volume":"7","author":"T Curtois","year":"2018","unstructured":"Curtois, T., Landa-Silva, D., Qu, Y., & Laesanklang, W. (2018). Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. EURO Journal on Transportation and Logistics, 7(2), 151\u2013192.","journal-title":"EURO Journal on Transportation and Logistics"},{"key":"650_CR18","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.omega.2015.10.009","volume":"63","author":"F Dunke","year":"2016","unstructured":"Dunke, F., & Nickel, S. (2016). A general modeling approach to online optimization with lookahead. Omega, 63, 134\u2013153.","journal-title":"Omega"},{"issue":"4","key":"650_CR19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.trb.2005.04.002","volume":"40","author":"A Fabri","year":"2006","unstructured":"Fabri, A., & Recht, P. (2006). On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Research Part B: Methodological, 40(4), 335\u2013350.","journal-title":"Transportation Research Part B: Methodological"},{"key":"650_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2014.02.001","volume":"63","author":"F Ferrucci","year":"2014","unstructured":"Ferrucci, F., & Bock, S. (2014). Real-time control of express pickup and delivery processes in a dynamic environment. Transportation Research Part B: Methodological, 63, 1\u201314.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"4","key":"650_CR21","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.jbi.2009.02.003","volume":"42","author":"C Fiegl","year":"2009","unstructured":"Fiegl, C., & Pontow, C. (2009). Online scheduling of pick-up and delivery tasks in hospitals. Journal of Biomedical Informatics, 42(4), 624\u2013632.","journal-title":"Journal of Biomedical Informatics"},{"issue":"4","key":"650_CR22","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1287\/trsc.1030.0074","volume":"38","author":"B Fleischmann","year":"2004","unstructured":"Fleischmann, B., Gnutzmann, S., & Sandvo\u00df, E. (2004). Dynamic vehicle routing based on online traffic information. Transportation Science, 38(4), 420\u2013433.","journal-title":"Transportation Science"},{"issue":"5","key":"650_CR23","first-page":"2508","volume":"11","author":"Z Gan","year":"2013","unstructured":"Gan, Z., Tao, L., & Ying, Q. (2013). Automated guided vehicles dynamic scheduling based on annealing genetic algorithm. TELKOMNIKA Indonesian Journal of Electrical Engineering, 11(5), 2508\u20132515.","journal-title":"TELKOMNIKA Indonesian Journal of Electrical Engineering"},{"issue":"3","key":"650_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J.-Y., & S\u00e9guin, R. (2006). Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies, 14(3), 157\u2013174.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"3","key":"650_CR25","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1287\/trsc.1110.0374","volume":"46","author":"G Ghiani","year":"2012","unstructured":"Ghiani, G., Manni, E., & Thomas, B. W. (2012). A comparison of anticipatory algorithms for the dynamic and stochastic traveling salesman problem. Transportation Science, 46(3), 374\u2013387.","journal-title":"Transportation Science"},{"issue":"3","key":"650_CR26","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ejor.2006.12.065","volume":"191","author":"A Goel","year":"2008","unstructured":"Goel, A., & Gruhn, V. (2008). A general vehicle routing problem. European Journal of Operational Research, 191(3), 650\u2013660.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"650_CR27","doi-asserted-by":"crossref","first-page":"21","DOI":"10.14257\/ijt.2014.2.1.02","volume":"2","author":"R Gomes","year":"2014","unstructured":"Gomes, R., de Sousa, J. P., & Dias, T. G. (2014). A grasp-based approach for demand responsive transportation. International Journal of Transportation, 2(1), 21\u201332.","journal-title":"International Journal of Transportation"},{"key":"650_CR28","volume-title":"Combinatorial online optimization in real time","author":"M Gr\u00f6tschel","year":"2001","unstructured":"Gr\u00f6tschel, M., Krumke, S. O., Rambau, J., Winter, T., & Zimmermann, U. T. (2001). Combinatorial online optimization in real time. Berlin: Springer."},{"issue":"1","key":"650_CR29","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied mathematics, 10(1), 196\u2013210.","journal-title":"Journal of the Society for Industrial and Applied mathematics"},{"key":"650_CR30","doi-asserted-by":"crossref","unstructured":"Karami, F., Vancroonenburg, W., and Vanden\u00a0Berghe, G. (2018). A dynamic scheduling approach to internal hospital logistics. In The Second International Workshop on Dynamic Scheduling Problems, Pozna\u0144, Poland, June 26\u201328 (pp. 57\u201362).","DOI":"10.14708\/isbn.978-83-951298-0-3p59-64"},{"issue":"2","key":"650_CR31","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.ejor.2011.04.033","volume":"214","author":"Y Kergosien","year":"2011","unstructured":"Kergosien, Y., Lente, C., Piton, D., & Billaut, J.-C. (2011). A tabu search heuristic for the dynamic transportation of patients between care units. European Journal of Operational Research, 214(2), 442\u2013452.","journal-title":"European Journal of Operational Research"},{"key":"650_CR32","unstructured":"Kilby, P., Prosser, P., & Shaw, P. (1998). Dynamic VRPs: A study of scenarios. University of Strathclyde Technical Report, 1\u201311."},{"key":"650_CR33","doi-asserted-by":"crossref","unstructured":"Kouki, Z., Chaar, B.\u00a0F., and Ksouri, M. (2009). Extended CNP framework for the dynamic pickup and delivery problem solving. In IFIP International Conference on Artificial Intelligence Applications and Innovations (pp. 61\u201371). Berlin: Springer.","DOI":"10.1007\/978-1-4419-0221-4_9"},{"issue":"6","key":"650_CR34","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. B., & Solomon, M. (2002). Partially dynamic vehicle routing-models and algorithms. Journal of the Operational Research Society, 53(6), 637\u2013646.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"650_CR35","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ejor.2007.12.037","volume":"194","author":"J-Q Li","year":"2009","unstructured":"Li, J.-Q., Mirchandani, P. B., & Borenstein, D. (2009). Real-time vehicle rerouting problems with time windows. European Journal of Operational Research, 194(3), 711\u2013727.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"650_CR36","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1287\/ijoc.1060.0186","volume":"19","author":"A Lim","year":"2007","unstructured":"Lim, A., & Zhang, X. (2007). A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS Journal on Computing, 19(3), 443\u2013457.","journal-title":"INFORMS Journal on Computing"},{"key":"650_CR37","unstructured":"Lund, K., Madsen, O.\u00a0B., and Rygaard, J.\u00a0M. (1996). Vehicle routing problems with varying degrees of dynamism (technical report). Lyngby, Denmark: IMM, The Department of Mathematical Modelling, Technical University of Denmark."},{"issue":"1","key":"650_CR38","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.trc.2009.04.018","volume":"18","author":"T M\u00e1hr","year":"2010","unstructured":"M\u00e1hr, T., Srour, J., de Weerdt, M., & Zuidwijk, R. (2010). Can agents measure up? A comparative study of an agent-based and on-line optimization approach for a drayage problem with uncertainty. Transportation Research Part C: Emerging Technologies, 18(1), 99\u2013119.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"8","key":"650_CR39","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Krishnamurti, R., & Laporte, G. (2004). Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 38(8), 669\u2013685.","journal-title":"Transportation Research Part B: Methodological"},{"issue":"7","key":"650_CR40","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.trb.2003.09.002","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., & Laporte, G. (2004). Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological, 38(7), 635\u2013655.","journal-title":"Transportation Research Part B: Methodological"},{"key":"650_CR41","doi-asserted-by":"crossref","unstructured":"Nagata, Y. and Kobayashi, S. (2010). A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover. In International Conference on Parallel Problem Solving from Nature (pp. 536\u2013545). Berlin: Springer.","DOI":"10.1007\/978-3-642-15844-5_54"},{"issue":"8","key":"650_CR42","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., & R\u00f8pke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403\u20132435.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"650_CR43","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/trsc.34.1.67.12283","volume":"34","author":"WB Powell","year":"2000","unstructured":"Powell, W. B., Towns, M. T., & Marar, A. (2000). On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of user noncompliance. Transportation Science, 34(1), 67\u201385.","journal-title":"Transportation Science"},{"issue":"2","key":"650_CR44","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis, H. N. (1980). A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science, 14(2), 130\u2013154.","journal-title":"Transportation Science"},{"issue":"1","key":"650_CR45","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.21628","volume":"67","author":"HN Psaraftis","year":"2016","unstructured":"Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016). Dynamic vehicle routing problems: Three decades and counting. Networks, 67(1), 3\u201331.","journal-title":"Networks"},{"issue":"3","key":"650_CR46","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: Information Systems and Operational Research, 46(3), 165\u2013175.","journal-title":"INFOR: Information Systems and Operational Research"},{"issue":"9","key":"650_CR47","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J Renaud","year":"2000","unstructured":"Renaud, J., Boctor, F. F., & Ouenniche, J. (2000). A heuristic for the pickup and delivery traveling salesman problem. Computers & Operations Research, 27(9), 905\u2013916.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"650_CR48","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"MW Savelsbergh","year":"1995","unstructured":"Savelsbergh, M. W., & Sol, M. (1995). The general pickup and delivery problem. Transportation Science, 29(1), 17\u201329.","journal-title":"Transportation Science"},{"issue":"3","key":"650_CR49","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1016\/j.ejor.2015.04.009","volume":"245","author":"M Schyns","year":"2015","unstructured":"Schyns, M. (2015). An ant colony system for responsive dynamic vehicle routing. European Journal of Operational Research, 245(3), 704\u2013718.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"650_CR50","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1287\/opre.1080.0520","volume":"57","author":"N Secomandi","year":"2009","unstructured":"Secomandi, N., & Margot, F. (2009). Reoptimization approaches for the vehicle-routing problem with stochastic demands. Operations Research, 57(1), 214\u2013230.","journal-title":"Operations Research"},{"issue":"3","key":"650_CR51","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1016\/j.ejor.2016.08.032","volume":"264","author":"MG Speranza","year":"2018","unstructured":"Speranza, M. G. (2018). Trends in transportation and logistics. European Journal of Operational Research, 264(3), 830\u2013836.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"650_CR52","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(98)00260-4","volume":"114","author":"MR Swihart","year":"1999","unstructured":"Swihart, M. R., & Papastavrou, J. D. (1999). A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. European Journal of Operational Research, 114(3), 447\u2013464.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"650_CR53","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/trsc.2016.0719","volume":"52","author":"MW Ulmer","year":"2017","unstructured":"Ulmer, M. W., Mattfeld, D. C., & K\u00f6ster, F. (2017). Budgeting time for dynamic vehicle routing with stochastic customer requests. Transportation Science, 52(1), 20\u201337.","journal-title":"Transportation Science"},{"issue":"3","key":"650_CR54","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.ejor.2016.03.021","volume":"253","author":"RR van Lon","year":"2016","unstructured":"van Lon, R. R., Ferrante, E., Turgut, A. E., Wenseleers, T., Vanden Berghe, G., & Holvoet, T. (2016). Measures of dynamism and urgency in logistics. European Journal of Operational Research, 253(3), 614\u2013624.","journal-title":"European Journal of Operational Research"},{"key":"650_CR55","unstructured":"Vancroonenburg, W., Esprit, E., Smet, P., & Vanden\u00a0Berghe, G. (2016). Optimizing internal logistic flows in hospitals by dynamic pick-up and delivery models. In Proceedings of the 11th international conference on the practice and theory of automated timetabling, Udine, Italy, 23\u201326 August (pp. 371\u2013383)."},{"issue":"2","key":"650_CR56","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/trsc.1030.0068","volume":"38","author":"J Yang","year":"2004","unstructured":"Yang, J., Jaillet, P., & Mahmassani, H. (2004). Real-time multivehicle truckload pickup and delivery problems. Transportation Science, 38(2), 135\u2013148.","journal-title":"Transportation Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00650-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-020-00650-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00650-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T23:18:13Z","timestamp":1624403893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-020-00650-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,23]]},"references-count":56,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["650"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00650-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,23]]},"assertion":[{"value":"23 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}