A hybrid genetic algorithm for the multi-depot open vehicle routing problem

被引：59

作者：

Liu, Ran ^{[1
]}

Jiang, Zhibin ^{[1
]}

Geng, Na ^{[1
]}

机构：

[1] Shanghai Jiao Tong Univ, Sch Mech Engn, Dept Ind Engn & Logist Management, Shanghai 200240, Peoples R China

来源：

OR SPECTRUM | 2014年 / 36卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Multiple depots; Open vehicle routing; Hybrid genetic algorithm; SEARCH ALGORITHM;

D O I：

10.1007/s00291-012-0289-0

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper studies the multi-depot open vehicle routing problem (MDOVRP), a variant of the vehicle routing problem (VRP), in which vehicles start from several depots and are not required to return to the depot. Despite the vast amount of literature about VRPs, the MDOVRP has received very little attention from researchers. In this paper, a new hybrid genetic algorithm is presented for finding the routes that minimize the traveling cost of the vehicles. Computational results on a number of test instances indicate the proposed algorithm dominates the CPLEX solver and the existing approach in the literature. Meanwhile, experiments are conducted on multi-depot VRP benchmarks, and the results are compared with a sophisticated tabu search approach and an exact

引用

页码：401 / 421

页数：21

共 49 条

[1] A unified exact method for solving different classes of vehicle routing problems [J].