© 2023In real-world routing applications such as waste collection or fuel distribution, multiple products that cannot be mixed should be jointly collected or delivered. Multi-compartment vehicles are applied with great flexibility in routing and assignment decisions for these real-world applications. This study concentrates on the multi-compartment vehicle routing problem with fixed compartment size and fixed assignment products to compartments. For this problem, we develop two new formulations in the space–time network and state-space–time network. For the state-space–time network formulation, we dualize the task allocation constraints to the objective function and decompose the Lagrangian relaxed problem (LR) into a series of identical routing subproblems. To produce high-quality feasible solutions, the augmented Lagrangian relaxed problem (ALR) with superior convergence and feasibility is further applied to this problem. The ALR is decomposed into many solvable routing subproblems by alternating direction method of multipliers. A time-dependent dynamic programming algorithm is developed to settle the obtained subproblems of the LR and ALR. The subgradient optimization method solves the Lagrangian dual problems. The solution quality can be evaluated by the relative gap between the global lower and upper bounds at each iteration. In numerical experiments, the proposed method produces solutions with good integrality gaps. Based on Lagrangian relaxation and decomposition techniques, this research provides a novel solving scheme for the multi-compartment vehicle routing problem.
https://doi.org/10.1016/j.eswa.2023.121511Cite as:
@article{Song_2024, title={Solving the multi-compartment vehicle routing problem by an augmented Lagrangian relaxation method}, volume={237}, ISSN={0957-4174}, url={http://dx.doi.org/10.1016/j.eswa.2023.121511}, DOI={10.1016/j.eswa.2023.121511}, journal={Expert Systems with Applications}, publisher={Elsevier BV}, author={Song, Maocan and Cheng, Lin and Lu, Bin}, year={2024}, month=mar, pages={121511} }