Multiple Depot Vehicle Routing Problem Based on Many-Objective Optimization
BI Zhisheng
ZHENG Jiongbin
CAI Guiyan
Abstract：Vehicle routing problem is a well-known NP problem in operations research,which has important practical significance in transportation field.As one of the important branches,multi-depot vehicle routing problem has been widely studied as a single-objective optimization problem and a multi-objective optimization problem.However,multi-depot vehicle routing problem is essentially a many-objective optimization problem.Therefore,in view of the nature of the problem,four optimization functions are inspected from the view of logistics enterprise and customer.Next,multi-depot vehicle routing problem based on many-objective optimization is proposed.Then,a framework called MO-MDVRP is constructed for this problem.After that,instances of this framework based on NSGA-Ⅲ and I-DBEA are proposed,namely MDVRP-NSGAⅢ and MDVRP-IDBEA.The algorithms are tests on six Cordeau datasets.The experiments show that MDVRP-NSGAⅢ and MDVRP-IDBEA are feasible in solving MO-MDVRP.And MDVRP-NSGAⅢ is more effective than MDVRP-IDBEA in these datasets.
Keywords：vehicle routing problemmulti-depotmany-objective optimization
Publication Date：2017-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：8( 1298-1304,1317 )