A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests

被引:0
作者
Sombuntham, Pandhapon [1 ]
Kachitvichayanukul, Voratas [1 ]
机构
[1] Asian Inst Technol, Pathum Thani 12120, Thailand
来源
INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III | 2010年
关键词
vehicle routing problem; pickup and delivery; multiple depot; particle swarm optimization;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A particle swarm optimization algorithm with multiple social learning structures is proposed for solving the practical case of multi-depot vehicle routing problem with simultaneous pickup and delivery and time window. In the problem of interest, each location may have goods for both pickup and delivery with multiple delivery locations that may not be the depots. An extension of GLNPSO with the new decoding procedure is proposed. Computational experiments are carried out using the test instances for the pickup and delivery problem with time windows (PDPTW) as well as a newly generated instance. The preliminary results show that the proposed algorithm is able to provide the good solutions to some of the problems.
引用
收藏
页码:1998 / 2003
页数:6
相关论文
共 13 条
[11]   A heuristic for the pickup and delivery traveling salesman problem [J].
Renaud, J ;
Boctor, FF ;
Ouenniche, J .
COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (09) :905-916
[12]   An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows [J].
Ropke, Stefan ;
Pisinger, David .
TRANSPORTATION SCIENCE, 2006, 40 (04) :455-472
[13]  
Solomon M.M., 1987, VEHICLE ROUTING PROB