Abstract
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’s availability is considered. Above all, the variant of customer’s 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.
Highlights
The basic Vehicle Routing Problem (VRP) consists in an efficient set of multiple routes for a fleet of vehicles that all start and end at a central depot to service a given set of customers, when each customer should be visited once by only one vehicle at the lowest cost
This paper presents an approach based on the algebraic-logical meta-model (ALMM) methodology for a dynamic vehicle routing problem with the possibility of modeling the dynamic predictive events, in particular, the appearance of new customers to visit during the simulation according to an appropriate general rule
The Dynamic Vehicle Routing Problem (DVRP) with predicted consumer availability has been surveyed in this paper
Summary
The basic Vehicle Routing Problem (VRP) consists in an efficient set of multiple routes for a fleet of vehicles that all start and end at a central depot to service a given set of customers (e.g., warehouses, stores, schools, cities), when each customer should be visited once by only one vehicle at the lowest cost. This paper presents an approach based on the ALMM methodology for a dynamic vehicle routing problem with the possibility of modeling the dynamic predictive events, in particular, the appearance of new customers to visit during the simulation according to an appropriate general rule. Supplementing and refining the classification of problems related to dynamic elements related to customers; presenting the possibilities of applying the Algebraic-Logical Meta-Model approach to dynamic problems where input data availability may depend on the state of the system and can be determined by a special rule. Collective decision making in dynamic vehicle routing problems with predicted consumer availability is proposed; presenting the possibilities of applying the Algebraic-Logical Meta-Model approach to dynamic problems with unexpected customer availability; The remainder of the paper is structured as follows.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
