Hybrid Genetic Algorithm for Multi-Period Vehicle Routing Problem with Mixed Pickup and Delivery with Time Window, Heterogeneous Fleet, Duration Time and Rest Area

Authors

  • Kittitach Kamsopa Khon Kaen University
  • Kanchana Sethanan Khon Kaen University
  • Thitipong Jamrus Khon Kaen University
  • Liliana Czwajda Polish Academy of Sciences

DOI:

https://doi.org/10.4186/ej.2021.25.10.71

Keywords:

mixed pickup and delivery with time windows, multi-period, rest area, hybrid genetic algorithm, variable neighborhood search algorithm, maximize profits

Abstract

Most logistics industries are improving their technology and innovation in competitive markets in order to serve the various needs of customers more efficiently. However, logistics management costs are one of the factors that entrepreneurs inevitably need to reduce, so that goods and services are distributed to a number of customers in different locations effectively and efficiently. In this research, we consider the multi-period vehicle routing problem with mixed pickup and delivery with time windows, heterogeneous fleet, duration time and rest area (MVRPMPDDR). In the special case that occurs in this research, it is the rest area for resting the vehicle after working long hours of the day during transportation over multiple periods, for which with confidence no research has studied previously. We present a mixed integer linear programming model to give an optimal solution, and a meta-heuristic approach using a hybrid genetic algorithm with variable neighborhood search algorithm (GAVNS) has been developed to solve large-sized problems. The objective is to maximize profits obtained from revenue after deducting fuel cost, the cost of using a vehicle, driver wage cost, penalty cost and overtime cost. We prepared two algorithms, including a genetic algorithm (GA) and variable neighborhood search algorithm (VNS), to compare the performance of our proposed algorithm. The VNS is specially applied instead of the mutation operator in GA, because it can reduce duplicate solutions of the algorithms that increase the difficulty and are time-consuming. The numerical results show the hybrid genetic algorithm with variable neighborhood search algorithm outperforms all other proposed algorithms. This demonstrates that the proposed meta-heuristic is efficient, with reasonable computational time, and is useful not only for increasing profits, but also for efficient management of the outbound transportation logistics system.

Downloads

Download data is not yet available.

Author Biographies

Kittitach Kamsopa

Research Unit on System Modeling for Industry, Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen, 40002, Thailand

Kanchana Sethanan

Research Unit on System Modeling for Industry, Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen, 40002, Thailand

Thitipong Jamrus

Research Unit on System Modeling for Industry, Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen, 40002, Thailand

Liliana Czwajda

Centre for Industrial Applications of Mathematics and Systems Engineering, Polish Academy of Sciences, ul. Śniadeckich 8, Warsaw, Poland

Downloads

Published In
Vol 25 No 10, Oct 31, 2021
How to Cite
[1]
K. Kamsopa, K. Sethanan, T. Jamrus, and L. Czwajda, “Hybrid Genetic Algorithm for Multi-Period Vehicle Routing Problem with Mixed Pickup and Delivery with Time Window, Heterogeneous Fleet, Duration Time and Rest Area”, Eng. J., vol. 25, no. 10, pp. 71-86, Oct. 2021.