Multi-Trip Multi-Compartment Vehicle Routing Problem with Backhauls

Abstract

The Multi-Trip Multi-Compartment Vehicle Routing Problem with Backhauls (MTMCVRPB) is a complex optimization problem that involves finding the most efficient routes for a heterogeneous fleet of multi-compartment vehicles to transport heterogeneous commodities simultaneously. The problem involves making deliveries and pickups while taking into account capacity constraints on compartments and other specific requirements such as limitation on route length. The MTMCVRPB aims to minimize the total cost of the routes, including the cost of vehicles, fuel and other expenses, while maximizing efficiency of vehicles and fulfilling the demand of customers. In order to solve the MTMCVRPB, this article recommends a mixed integer linear programming (MILP) formulation. The proposed model takes into consideration the demands of both linehaul and backhaul customers, ensuring that on each route linehaul deliveries are made before visiting any backhaul customer. The model was tested on benchmark instances from literature and randomly generated data sets and numerical experiments were performed to demonstrate its effectiveness. The proposed model can be beneficial for the industries such as grocery and food delivery, fuel distribution and garbage collection as these are main applications of this model. We have also provided a saving based heuristic by making certain modifications to find the quick and efficient solution to the proposed model.