A hybrid metaheuristic algorithm for the VRPSPD problem

作者：Jiang Qingguo; Wang Chao^*; Mu Dong; Zhou Lingyun

来源：Journal of Computational Information Systems, 2015, 11(13): 4845-4856.

DOI：10.12733/jcis14634

• Combinatorial optimization problems
• Computational results
• High-quality solutions
• Hybrid metaheuristic algorithms
• Metaheuristic
• Neighborhood structure
• Simultaneous pickup and deliveries
• Vehicle Routing Problems

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-7-1
• 单位北京大学; 北京交通大学