A two-stage metaheuristic algorithm for the dynamic vehicle routing problem in Industry 4.0 approach
Abdirad, Maryam Krishnan, Krishna K. Gupta, Deepak P.
Abdirad, Maryam
Krishnan, Krishna K.
Gupta, Deepak P.
Citations
Altmetric:
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
2020-10-02
Type
Article
Genre
Keywords
Dynamic vehicle routing problem,Heuristic algorithms,Industry 4.0,Two-stage algorithm
Subjects (LCSH)
Citation
Maryam Abdirad, Krishna Krishnan & Deepak Gupta (2020) A two-stage metaheuristic algorithm for the dynamic vehicle routing problem in Industry 4.0 approach, Journal of Management Analytics
Abstract
Industry 4.0 is a concept that assists companies in developing a modern supply chain (MSC) system when they are faced with a dynamic process. Because Industry 4.0 focuses on mobility and real-time integration, it is a good framework for a dynamic vehicle routing problem (DVRP). This research works on DVRP. The aim of this research is to minimize transportation cost without exceeding the capacity constraint of each vehicle while serving customer demands from a common depot. Meanwhile, new orders arrive at a specific time into the system while the vehicles are executing the delivery of existing orders. This paper presents a two-stage hybrid algorithm for solving the DVRP. In the first stage, construction algorithms are applied to develop the initial route. In the second stage, improvement algorithms are applied. Experimental results were designed for different sizes of problems. Analysis results show the effectiveness of the proposed algorithm.
Table of Contents
Description
Click on the DOI link to access the article (may not be free).
Publisher
Taylor and Francis Ltd
Journal
Book Title
Series
Journal of Management Analytics;2020
Digital Collection
Finding Aid URL
Use and Reproduction
Archival Collection
PubMed ID
DOI
ISSN
2327-0012