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

08/26/2020
by   Maryam Abdirad, et al.
4

Industry 4.0 is a concept which helps companies to have a smart supply chain system when they are faced with a dynamic process. As Industry 4.0 focuses on mobility and real-time integration, it is a good framework for a Dynamic Vehicle Routing problem (DVRP). The main objective of this research is to solve the DVRP on a large-scale size. The aim of this study is to show that the delivery vehicles must serve customer demands from a common depot to have a minimum transit cost without exceeding the capacity constraint of each vehicle. In VRP, to reach an exact solution is quite difficult, and in large-size real world problems it is often impossible. Also, the computational time complexity of this type of problem grows exponentially. In order to find optimal answers for this problem in medium and large dimensions, using a heuristic approach is recommended as the best approach. A hierarchical approach consisting of three stages as cluster-first, route-construction second, route-improvement third is proposed. In the first stage, customers are clustered based on the number of vehicles with different clustering algorithms (i.e., K-mean, GMM, and BIRCH algorithms). In the second stage, the DVRP is solved using construction algorithms and in the third stage improvement algorithms are applied. The second stage is solved using construction algorithms (i.e. Savings algorithm, path cheapest arc algorithm, etc.). In the third stage, improvement algorithms such as Guided Local Search, Simulated Annealing and Tabu Search are applied. One of the main contributions of this paper is that the proposed approach can deal with large-size real world problems to decrease the computational time complexity. The results of this approach confirmed that the proposed methodology is applicable.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

08/10/2020

A Two-Stage Metaheuristic Algorithm for the Dynamic Vehicle Routing Problem in Industry 4.0 approach

Industry 4.0 is a concept that assists companies in developing a modern ...
04/26/2014

Hybrid Metaheuristics for the Clustered Vehicle Routing Problem

The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capac...
04/07/2020

Hybrid 2-stage Imperialist Competitive Algorithm with Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problem

The Multi-Depot Vehicle Routing Problem (MDVRP) is a real-world model of...
08/27/2020

Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations

Dynamic routing occurs when customers are not known in advance, e.g. for...
08/10/2017

The Static and Stochastic VRPTW with both random Customers and Reveal Times: algorithms and recourse strategies

Unlike its deterministic counterpart, static and stochastic vehicle rout...
11/05/2020

Fast, Exact and Scalable Dynamic Ridesharing

We study the problem of servicing a set of ride requests by dispatching ...
08/06/2020

A Multiperiod Workforce Scheduling and Routing Problem with Dependent Tasks

In this paper, we study a new Workforce Scheduling and Routing Problem, ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.