A novel two-phase approach for solving the multi-compartment vehicle routing problem with a heterogeneous fleet of vehicles: a case study on fuel delivery

Abstract

Distribution of goods is one of the main issues that directly affect the performance of the companies since efficient distribution of goods saves energy costs and also leads to reduced environmental impact. The multi-compartment vehicle routing problem (MCVRP) with a heterogeneous fleet of vehicles is encountered when dealing with this situation in many practical cases. This paper is motivated by the fuel delivery problem where the main objective of this research is to minimize the total driving distance using a minimum number of vehicles. Based on a case study of twenty petrol stations in northeastern Thailand, a novel two-phase heuristic, which is a variant of the Fisher and Jaikumar Algorithm (FJA), is proposed. The study first formulates an MCVRP model and then a mixed-integer linear programming (MILP) model is formulated for selecting the numbers and types of vehicles. A new clustering-based model is also developed in order to select the seed nodes and all customer nodes are considered as candidate seed nodes. The new Generalized Assignment Problem model (GAP model) is formulated to allocate the customers into each cluster. Finally, based on the traveling salesman problem (TSP), each cluster is solved in order to minimize the total driving distance. Numerical results show that the proposed heuristic is effective for solving the proposed model. The proposed algorithm can be used to minimize the total driving distance and the number of vehicles of the distribution network for fuel delivery.

Integrated mathematical model based on a heuristic method for loading and routing of vehicles: application in a tobacco company

“…Most of the cases that integrate these two approaches belongs to the kind of problems with solutions that present strongly undetermined polynomial time (strongly NP-hard), so they are a challenge for achieving an optimal solution (IORI; MARTELLO, 2016). This is the case of the VRP, which is well-known as an NP-hard problem (PIQUERAS, 2002;LÜER et al, 2009;MEDINA et al 2011;CHOWMALI;SUKTO, 2020), and it is a famous problem in operations research and combinatorial optimization (CHOKANAT et al, 2019;WICHAPA; KHOKHAJAIKIAT, 2018). The vehicles freight distribution problem with loading constraints is also considered as NP-hard problem (PACE et al, 2015).…”