Particle swarm optimization for vehicle routing problem with time windows

被引：0

作者：

Wang, Fang ^{[1
]}

Wu, Qizong ^{[1
]}

机构：

[1] Beijing Inst Technol, Sch Management & Econ, Beijing 100081, Peoples R China

来源：

PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON RISK AND RELIABILITY MANAGEMENT, VOLS I AND II | 2008年

关键词：

vehicle routing problem; time windows; particle swarm optimization;

D O I：

暂无

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Particle swarm optimization is introduced to deal with the vehicle routing problem with time windows (VRPTW). According to the model of VRPTW and the traits of particle swarm optimization, the crossover particle swarm optimization by combining the ideal of the genetic algorithm is set up. Experimental results indicate that the crossover particle swarm optimization can get optimal resolution of VRPTW effectively and quickly.

引用

页码：962 / 966

页数：5

共 12 条

[1]

[Anonymous], TRANSPORTATION PLANN, DOI DOI 10.1080/03081069208717490

[2]

[Anonymous], 1995, 1995 IEEE INT C

[3]

CARLISLE A, 2000, P INT C ART INT LAS, P429

[4] Modeling rolling batch planning as vehicle routing problem with time windows [J].

Chen, X ;

Wan, WS ;

Xu, XH .

COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (12) :1127-1136

[5]

CLEC M, 2006, IEEE T EVOLUTIONARY, V6, P58

[6] THE TRUCK DISPATCHING PROBLEM [J].

DANTZIG, GB ;

RAMSER, JH .

MANAGEMENT SCIENCE, 1959, 6 (01) :80-91

[7]

Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374

[8]

LI J, THEORIES METHODS LOG

[9]

LI N, 2004, SYSTEMS ENG THEORY P, P130

[10]

OLLI B, 2001, SPECIAL ISSUE BIOINF, V1, P33

← 1 2 →