A1 Journal article (refereed), original research (Journal article, original research)

Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study


Open Access publication


Publication Details

Authors: Le Thi Diem Chau, Nguyen Duy Duc, Oláh Judit, Pakurár Miklós

Publication year: 2020

Language: English

Related journal or series: Production Engineering Archives

Volume number: 26

Start page: 174

End page: 184

Number of pages: 11

ISSN: 2353-5156

eISSN: 2353-7779

JUFO level of this publication: 1

Digital Object Identifier (DOI): http://dx.doi.org/10.30657/pea.2020.26.31

Open Access: Open Access publication


Abstract

This study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.


Last updated on 2021-03-12 at 08:57