Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations

08/27/2020
by   Wolfgang Garn, et al.
0

Dynamic routing occurs when customers are not known in advance, e.g. for real-time routing. Two heuristics are proposed that solve the balanced dynamic multiple travelling salesmen problem (BD-mTSP). These heuristics represent operational (tactical) tools for dynamic (online, real-time) routing. Several types and scopes of dynamics are proposed. Particular attention is given to sequential dynamics. The balanced dynamic closest vehicle heuristic (BD-CVH) and the balanced dynamic assignment vehicle heuristic (BD-AVH) are applied to this type of dynamics. The algorithms are tested for instances in the Euclidean plane. Continuous approximation models for the BD-mTSP's are derived and serve as strategic tools for dynamic routing. The models express route lengths using vehicles, customers and dynamic scopes without the need of running an algorithm. A machine learning approach was used to obtain regression models. The mean-average-percentage error of two of these models is below 3

READ FULL TEXT
research
01/21/2020

Closed form distance formula for the balanced multiple travelling salesmen

As a first contribution the mTSP is solved using an exact method and two...
research
02/24/2021

Fast Approximate Solutions using Reinforcement Learning for Dynamic Capacitated Vehicle Routing with Time Windows

This paper develops an inherently parallelised, fast, approximate learni...
research
06/16/2020

Learning to Solve Vehicle Routing Problems with Time Windows through Joint Attention

Many real-world vehicle routing problems involve rich sets of constraint...
research
08/26/2020

A Three-Stage Algorithm for the Large Scale Dynamic Vehicle Routing Problem with an Industry 4.0 Approach

Industry 4.0 is a concept which helps companies to have a smart supply c...
research
09/14/2021

Probabilistic Analysis of Euclidean Capacitated Vehicle Routing

We give a probabilistic analysis of the unit-demand Euclidean capacitate...
research
04/22/2023

Euclidean Capacitated Vehicle Routing in Random Setting: A 1.55-Approximation Algorithm

We study the unit-demand capacitated vehicle routing problem in the rand...
research
06/25/2023

Routing One Million Customers in a Handful of Minutes

In this paper, we propose a new dataset of Capacitated Vehicle Routing P...

Please sign up or login with your details

Forgot password? Click here to reset