A hybrid metaheuristic algorithm for the VRPSPD problem - 文章详情页

作者：

Jiang, Qingguo (Jiang, Qingguo.) | Wang, Chao (Wang, Chao.) | Mu, Dong (Mu, Dong.) | Zhou, Lingyun (Zhou, Lingyun.)

收录：

EI Scopus

摘要：

This　paper　addresses　a　vehicle　routing　problem　which　considers　customers　to　require　simultaneous　pickup　and　delivery　service　(VRPSPD).　The　VRPSPD　problem　is　an　NP-hard　combinatorial　optimization　problem;　therefore　exact　methods　are　incapable　of　solving　large　scale　VRPSPD　instances.　A　tabuembedded　simulated　annealing　metaheuristic　(TSSA)　that　utilizes　four　different　neighborhood　structures　is　presented　to　deal　with　this　problem.　18　test　problems　with　100-400　customers　from　Montane　and　Galvao＇s　benchmark　are　used　to　test　the　performance　of　the　TSSA　algorithm.　Computational　results　demonstrate　that　TSSA　could　produce　high　quality　solutions.　©,　2015,　Journal　of　Computational　Information　Systems.　All　right　reserved.

关键词：

Tabu search Combinatorial optimization Pickups Optimization Vehicle routing Amphibious vehicles Simulated annealing Benchmarking Algorithms

作者机构：

[ 1 ] [Jiang, Qingguo]School of Electrical and Electronic Engineering, North China Electric Power University, Beijing, China
[ 2 ] [Wang, Chao]School of Economics and Management, Beijing University of Technology, Beijing, China
[ 3 ] [Mu, Dong]School of Economics and Management, Beijing Jiaotong University, Beijing, China
[ 4 ] [Zhou, Lingyun]School of Traffic Engineering, Huaiyin Institute of Technology, Huaian, China

通讯作者信息：

[wang, chao]school of economics and management, beijing university of technology, beijing, china

电子邮件地址：

查看成果更多字段

成果类型
所属机构

所有年份指定年份从至