Next Article in Journal
Covering-Based Spherical Fuzzy Rough Set Model Hybrid with TOPSIS for Multi-Attribute Decision-Making
Next Article in Special Issue
Edge Detection Algorithm of a Symmetric Difference Kernel SAR Image Based on the GAN Network Model
Previous Article in Journal
OpinionML—Opinion Markup Language for Sentiment Representation
Previous Article in Special Issue
An Effective Global Optimization Algorithm for Quadratic Programs with Quadratic Constraints
Article Menu

Article Versions

Export Article

Open AccessArticle
Symmetry 2019, 11(4), 546; https://doi.org/10.3390/sym11040546

Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability

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
Received: 27 February 2019 / Revised: 4 April 2019 / Accepted: 11 April 2019 / Published: 15 April 2019
(This article belongs to the Special Issue New Trends in Dynamics)
PDF [1421 KB, uploaded 15 April 2019]

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.
Keywords: dynamic vehicle routing problem; modeling and optimization of dynamic discrete systems; collective decision making; heuristic method; multistage decision process; algebraic-logical meta-model (ALMM) dynamic vehicle routing problem; modeling and optimization of dynamic discrete systems; collective decision making; heuristic method; multistage decision process; algebraic-logical meta-model (ALMM)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Kucharska, E. Dynamic Vehicle Routing Problem—Predictive and Unexpected Customer Availability. Symmetry 2019, 11, 546.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top