万芳(学),郭海湘：A mathematical method for solving multi-depot vehicle routing problem.

我校bat365在线中国官网登录入口郭海湘老师在T3级别期刊——《Soft Computing》上发表题为“A mathematical method for solving multi-depot vehicle routing problem”。论文作者郭海湘为bat365在线中国官网登录入口教授、博士生导师。

Abstract /摘要：

Because logistics companies usually have multiple depots to serve their many dispersed customers, multi-depot vehicle routing problem (MDVRP) has gained significant research attention. To solve an MDVRP model, this paper develops a hybrid ant colony optimization based on a polygonal circumcenter (BPC-HACO). Furthermore, because ACO has been found to fall easily into the local optimum, simulated annealing and three local optimization operations are introduced to encourage the ACO to improve the algorithm’s optimization ability. Finally, MDVRP benchmarks and data sets of other papers are employed to verify the effectiveness of the BPC-HACO in solving MDVRP (In 23 instances, BPC-HACO finds 14 BSKs, and 3 results are better than the BSKs), MDVRP with distance constraints (Compared to other papers, the route length is reduced by an average of 17.94%) and dynamic MDVRP (In 10 instances, BPC-HACO finds 3 BSKs, and 2 results are better than the BSKs). Finally, fitness landscape analysis has been applied to analyze the structural features of MDVRP to choose the most appropriate algorithm for MDVRP.

Title/题目:

A mathematical method for solving multi-depot vehicle routing problem

Authors/作者:

wan Fang; Guo Haixiang; Pan Wenwen; Hou Jundong; Chen Shengli

Keywords /关键词

Multi-depot vehicle routing problem;Polygonal circumcenter;Ant colony optimization;Simulated annealing

Indexed by /核心评价

AHCI;EI;INSPEC;SCI;Scopus;WAJCI

DOI:10.1007/S00500-023-08811-8

全文链接：

https://libproxy.cug.edu.cn/https/443/com/springer/link/yitlink/article/10.1007/S00500-023-08811-8?utm_source=cnki&utm_medium=affiliate&utm_content=meta&utm_campaign=DDCN_1_GL01_metadata.