The location-routing problem with multi-compartment and multi-trip: formulation and heuristic approaches
Year: 2020
Type: article
Abstract: 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.
Authors: Ilkyeong Moon, Said Salhi, Xuehao Feng
Institutions: Seoul National University, University of Kent, Zhejiang University
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
Award: G7684519300
OpenAlex ID: W3001422724
