The location-routing problem with multi-compartment and multi-trip is an extension to the standard location-routing problem. In this problem, depots are used to deliver different products using heterogeneous vehicles with several compartments. Each compartment has a limited capacity and is dedicated to a single type of product. The problem is formulated as a mixed integer program. A constructive heuristic and a hybrid genetic algorithm (HGA) are proposed. Numerical experiments show that both heuristics can efficiently determine the optimal solutions on small size instances. For larger ones, the HGA outperforms the constructive heuristic with relatively more computational time. Managerial insights have been obtained from sensitivity analyses which would be helpful to improve the performance of the supply network.
The location-routing problem with multi-compartment and multi-trip: formulation and heuristic approaches
Transportmetrica A: Transport Science ; 16 , 3 ; 501-528
2020-01-01
28 pages
Article (Journal)
Electronic Resource
Unknown
Location and Multi-Compartment Capacitated Vehicle Routing Problem for Blood Banking System
BASE | 2018
|A Multi-Compartment Vehicle Routing Problem with Loading and Unloading Costs
British Library Online Contents | 2019
|