{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:35:15Z","timestamp":1767339315407,"version":"build-2065373602"},"reference-count":48,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T00:00:00Z","timestamp":1555286400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The Dynamic Vehicle Routing Problem (DVRP) is one of the most important problems in the area of enterprise logistics. DVRP problems involve these dynamics: the appearance of customers, travel times, service times, or vehicle availability. One of the most often considered aspects of the DVRP is the availability of customers, in which a part or all of the customers are revealed dynamically during the design or execution of the routes. A classification of the DVRP problem due to various elements causing dynamism is proposed. The aim of the paper is to distinguish dynamic VRP, which takes into account the dynamic appearance of customers to serve during the design or execution of the routes. In particular, the difference between the predictive and unexpected aspects of the customer\u2019s availability is considered. Above all, the variant of customer\u2019s availability which is predicted according to an appropriate general rule is modeled using the algebraic-logical meta-model (ALMM). It is a methodology which enables making collective decisions in successive process stages, not separately for individual vehicles. The algebraic-logical model of the dynamic vehicle routing problem with predicted consumer availability is proposed. The paper shows the possibilities of applying the ALMM approach to dynamic problems both with predicted and unexpected customer availability.<\/jats:p>","DOI":"10.3390\/sym11040546","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:02:01Z","timestamp":1555470121000},"page":"546","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Dynamic Vehicle Routing Problem\u2014Predictive and Unexpected Customer Availability"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6551-5062","authenticated-orcid":false,"given":"Edyta","family":"Kucharska","sequence":"first","affiliation":[{"name":"AGH University of Science and Technology, Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering, Department of Automatics and Robotics, 30 Mickiewicza Av, 30-059 Krakow, Poland"}]}],"member":"1968","published-online":{"date-parts":[[2019,4,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Alba, E., Nakib, A., and Siarry, P. (2013). Metaheuristics for Dynamic Vehicle Routing. Metaheuristics for Dynamic Optimization, Springer.","DOI":"10.1007\/978-3-642-30665-5"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2014). Vehicle Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611973594"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10479-011-0991-3","article-title":"A dynamic vehicle routing problem with multiple delivery routes","volume":"199","author":"Azi","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_4","unstructured":"Barnhart, C., and Laporte, G. (2007). Vehicle routing. Transportation, Elsevier B.V."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Toth, P., and Vigo, D. (2002). The VRP with pickup and delivery. The Vehicle Routing Problem, Society of Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898718515"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.4018\/ijamc.2015070103","article-title":"Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery: A Cooperative Approach","volume":"6","author":"Berghida","year":"2015","journal-title":"Inter. J. Appl. Metaheur. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/jamc.2011040101","article-title":"Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup","volume":"2","author":"Maquera","year":"2011","journal-title":"Int. J. Appl. Metaheur. Comput."},{"key":"ref_8","unstructured":"Soonpracha, K., Mungwattana, A., Janssens, G.K., and Manisri, T. (2014, January 12\u201314). Heterogeneous VRP review and conceptual framework. Proceedings of the International MultiConference of Engineers and Computer Scientists, Hong Kong."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Panicker, V., and Ihsan, M. (2018, January 6\u20137). Solving a Heterogeneous Fleet Vehicle Routing Model-A practical approach. Proceedings of the 2018 IEEE International Conference on System, Computation, Automation and Networking, Pondicherry, India.","DOI":"10.1109\/ICSCAN.2018.8541149"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kaewman, S., and Akararungruangkul, R. (2018). Heuristics Algorithms for a Heterogeneous Fleets VRP with Excessive Demand for the Vehicle at the Pickup Points and the Longest Traveling Time Constraint: A Case Study in Prasitsuksa Songkloe, Ubonratchathani Thailand. Logistic, 2.","DOI":"10.3390\/logistics2030015"},{"key":"ref_11","first-page":"1","article-title":"A Firefly Algorithm for the Heterogeneous Fixed Fleet VRP","volume":"33","author":"Matthopoulos","year":"2018","journal-title":"Int. J. Ind. Syst. Eng."},{"key":"ref_12","unstructured":"Ho, S., Nagavarapu, S.C., Pandi, R.R., and Dauwels, J. (2019, February 20). An Improved Tabu Search Heuristic for Static Dial-A-Ride Problem. Available online: https:\/\/arxiv.org\/abs\/1801.09547."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10479-017-2525-0","article-title":"Typology and literature review for dial-a-ride problems","volume":"259","author":"Molenbruch","year":"2017","journal-title":"Ann. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/trsc.1070.0227","article-title":"Per-seat, on-demand air transportation part I: Problem description and an integer multicommodity flow model","volume":"43","author":"Espinoza","year":"2008","journal-title":"Transp. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Ritzinger, U., and Puchinger, J. (2013). Hybrid metaheuristics for dynamic and stochastic vehicle routing. Hybrid Metaheuristics, Springer.","DOI":"10.1007\/978-3-642-30671-6_2"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","article-title":"A review of dynamic vehicle routing problems","volume":"225","author":"Pillac","year":"2013","journal-title":"Eur. J. Operational Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","article-title":"Adaptive memory programming: A unified view of metaheuristics","volume":"135","author":"Taillard","year":"2001","journal-title":"Eur. J. Opera. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","article-title":"Ant colony system for a dynamic vehicle routing problem","volume":"10","author":"Montemanni","year":"2005","journal-title":"J. Comb. Optim."},{"key":"ref_19","unstructured":"Caramia, M., Italiano, G., Oriolo, G., Pacifici, A., and Perugia, A. (, January September). Routing a fleet of vehicles for dynamic combined pick-up and deliveries services. Proceedings of the Operations Research Proceedings 2001, Duisburg, Germany."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ejor.2008.03.023","article-title":"An approximate dynamic programming approach for the vehicle routing problem with stochastic demands","volume":"196","author":"Novoa","year":"2009","journal-title":"Eur. J. Opera. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2017.01.047","article-title":"On solving periodic re-optimization dynamic vehicle routing problems","volume":"55","author":"Abdallah","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_22","first-page":"03003","article-title":"Collective decision making in dynamic vehicle routing problem","volume":"252","author":"Kucharska","year":"2019","journal-title":"Comput. Artif. Intell"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Dutkiewicz, L., Kucharska, E., Ra\u0327czka, K., and Grobler-D\u0229bska, K. (2016). ST method-based algorithm for the supply routes for multilocation companies problem. Knowledge, Information and Creativity Support Systems: Recent Trends, Advances and Solutions, Springer.","DOI":"10.1007\/978-3-319-19090-7_10"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/net.21628","article-title":"Dynamic vehicle routing problems: Three decades and counting","volume":"2016","author":"Psaraftis","year":"2016","journal-title":"Netw"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/j.asoc.2013.01.007","article-title":"Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands","volume":"13","author":"Marinakis","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.cie.2011.10.001","article-title":"Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm","volume":"62","author":"Ruiz","year":"2012","journal-title":"Comput. Indust. Eng."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Grippa, P. (2016, January 9\u201314). Decision making in a UAV-based delivery system with impatient customers. Proceedings of the Intelligent Robots and Systems (IROS), Daejeon, South Korea.","DOI":"10.1109\/IROS.2016.7759739"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2016\/9848916","article-title":"An inverse robust optimisation approach for a class of vehicle routing problems under uncertainty","volume":"2016","author":"Sun","year":"2016","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.eswa.2017.01.038","article-title":"Heuristics for the robust vehicle routing problem with time windows","volume":"77","author":"Braaten","year":"2017","journal-title":"Exp. Syst. Appl."},{"key":"ref_30","first-page":"127","article-title":"The vehicle-routing problem","volume":"8","author":"Daneshzand","year":"2011","journal-title":"Logist. Oper. Manag."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"9302","DOI":"10.1016\/j.apm.2016.06.013","article-title":"Adaptive Memory Artificial Bee Colony Algorithm for Green Vehicle Routing with Cross-Docking","volume":"40","author":"Yin","year":"2016","journal-title":"Appl. Math. Model."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.engappai.2016.02.006","article-title":"Cooperative Coevolutionary Approach for Integrated Vehicle Routing and Scheduling Using Cross-Dock Buffering","volume":"52","author":"Yin","year":"2016","journal-title":"Eng. Appli. Art. Intell."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1057\/jors.2010.19","article-title":"Disruption management of the vehicle routing problem with vehicle breakdown","volume":"62","author":"Mu","year":"2011","journal-title":"J. Oper. Res. Soc."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1007\/s11590-015-0944-x","article-title":"Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem","volume":"10","author":"Guedes","year":"2016","journal-title":"Opt. Lett."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/j.ejor.2007.12.037","article-title":"Real-time vehicle rerouting problems with time windows","volume":"194","author":"Li","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.dss.2012.06.007","article-title":"An event-driven optimization framework for dynamic vehicle routing","volume":"54","author":"Pillac","year":"2012","journal-title":"Decis. Supp. Syst."},{"key":"ref_37","unstructured":"Dudek-Dyduch, E. (1990). Formalization and Analysis of Problems of Discrete Manufacturing Processes, Scientific Bulletin of AGH University. (In Polish)."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Dudek-Dyduch, E. (2015, January 14\u201318). Algebraic Logical Meta-Model of Decision Processes\u2014New Metaheuristics. Proceedings of the International Conference on Artificial Intelligence and Soft Computing, Zakopane, Poland.","DOI":"10.1007\/978-3-319-19324-3_48"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1008934615349","article-title":"Learning based algorithm in scheduling","volume":"11","year":"2000","journal-title":"J. Intelli. Manuf."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Dudek-Dyduch, E., and Dyduch, T. (2006). Learning algorithms for scheduling using knowledge based model. Artif. Intell. Soft Comput., 1091\u20131100.","DOI":"10.1007\/11785231_114"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Dudek-Dyduch, E., and Kucharska, E. (2011, January 21\u201323). Learning Method for Co-operation. Proceedings of the International Conference on Computational Collective Intelligence, Gdynia, Poland.","DOI":"10.1007\/978-3-642-23938-0_30"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Kucharska, E., and Dudek-Dyduch, E. (2014). Extended Learning Method for Designation of Co-Operation. Transactions on Computational Collective Intelligence XIV, Springer.","DOI":"10.1007\/978-3-662-45911-9_7"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Kucharska, E. (2017). Heuristic Method for Decision-Making in Common Scheduling Problems. Appl. Sci., 7.","DOI":"10.3390\/app7101073"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Dudek-Dyduch, E., and Dutkiewicz, L. (2013, January 9\u201313). Substitution tasks method for discrete optimization. Proceedings of the 12th International Conference Artificial Intelligence and Soft Computing (ICAISC 2013), Zakopane, Poland.","DOI":"10.1007\/978-3-642-38610-7_39"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., and Zurada, J.M. (2014). ALMM solver\u2014A tool for optimization problems. Artificial Intelligence and Soft Computing, Springer.","DOI":"10.1007\/978-3-319-07176-3"},{"key":"ref_46","unstructured":"Kozielski, S., Mrozek, D., Kasprowski, P., Ma\u0142ysiak-Mrozek, B., and Kostrzewa, D. (2015). ALMM solver: The idea and the architecture. International Conference on Artificial Intelligence and Soft Computing, Springer."},{"key":"ref_47","unstructured":"Kozielski, S., Mrozek, D., Kasprowski, P., Ma\u0142ysiak-Mrozek, B., and Kostrzewa, D. (2017). ALMM solver-database structure and data access layer architecture. International Conference: Beyond Databases, Architectures and Structures, Springer."},{"key":"ref_48","unstructured":"Kozielski, S., Mrozek, D., Kasprowski, P., Ma\u0142ysiak-Mrozek, B., and Kostrzewa, D. (2018). ALMM Solver-Idea of Algorithm Module. Beyond Databases, Architectures and Structures, Springer."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/4\/546\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:45:40Z","timestamp":1760186740000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/4\/546"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,15]]},"references-count":48,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,4]]}},"alternative-id":["sym11040546"],"URL":"https:\/\/doi.org\/10.3390\/sym11040546","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2019,4,15]]}}}