Scatter search for the fleet size and mix vehicle routing problem with time windows

被引：14

作者：

Belfiore, Patricia Prado ^{[1
]}

Lopes Favero, Luiz Paulo ^{[2
]}

机构：

[1] FEI Univ Ctr, Dept Prod Engn, BR-09850901 Sao Bernardo Do Campo, Brazil

[2] Univ Sao Paulo, Sch Econ Business & Accounting, Dept Accountancy, BR-05508900 Sao Paulo, Brazil

来源：

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH | 2007年 / 15卷 / 04期

关键词：

scatter search; vehicle routing; heterogeneous fleet; time windows;

D O I：

10.1007/s10100-007-0036-9

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This work proposes a scatter search (SS) approach to solve the fleet size and mix vehicle routing problem with time windows (FSMVRPTW). In the FSMVRPTW the customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. Computational results on 168 benchmark problems are reported. Computational testing revealed that our algorithm presented better results compared to other methods published in the literature.

引用

页码：351 / 368

页数：18