One-Stage Search for Multi-Depot Vehicle Routing Problem

T. Jin, S. Guo, F. Wang, and A. Lim (PRC)


Multi-depot Vehicle Routing, Heuristic, One-stage Ap proach


This paper studies one of the core problems in the sup ply chain management and transportation - Multi-depot Vehicle Routing Problem (MDVRP). After modelling the MDVRP as a binary programming problem, we present two solving methodologies - two-stage and one-stage ap proaches. Two-stage approach decomposes the MDVRP into two independent subproblems - assignment and rout ing, and solves it separately. In contrast, our proposed one stage algorithm integrates the assignment with the routing. Experimental results on the benchmark data show that the one-stage algorithm outperforms the published two-stage methods.

Important Links:

Go Back