Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability

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 a...

Full description

Bibliographic Details
Main Author: Edyta Kucharska
Format: Article
Language:English
Published: MDPI AG 2019-04-01
Series:Symmetry
Subjects:
Online Access:https://www.mdpi.com/2073-8994/11/4/546
id doaj-db74098afddf47f9bc7c36b247305b12
record_format Article
spelling doaj-db74098afddf47f9bc7c36b247305b122020-11-25T00:19:02ZengMDPI AGSymmetry2073-89942019-04-0111454610.3390/sym11040546sym11040546Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer AvailabilityEdyta Kucharska0AGH 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, PolandThe 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.https://www.mdpi.com/2073-8994/11/4/546dynamic vehicle routing problemmodeling and optimization of dynamic discrete systemscollective decision makingheuristic methodmultistage decision processalgebraic-logical meta-model (ALMM)
collection DOAJ
language English
format Article
sources DOAJ
author Edyta Kucharska
spellingShingle Edyta Kucharska
Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability
Symmetry
dynamic vehicle routing problem
modeling and optimization of dynamic discrete systems
collective decision making
heuristic method
multistage decision process
algebraic-logical meta-model (ALMM)
author_facet Edyta Kucharska
author_sort Edyta Kucharska
title Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability
title_short Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability
title_full Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability
title_fullStr Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability
title_full_unstemmed Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability
title_sort dynamic vehicle routing problem—predictive and unexpected customer availability
publisher MDPI AG
series Symmetry
issn 2073-8994
publishDate 2019-04-01
description 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.
topic dynamic vehicle routing problem
modeling and optimization of dynamic discrete systems
collective decision making
heuristic method
multistage decision process
algebraic-logical meta-model (ALMM)
url https://www.mdpi.com/2073-8994/11/4/546
work_keys_str_mv AT edytakucharska dynamicvehicleroutingproblempredictiveandunexpectedcustomeravailability
_version_ 1725373730448736256