|
|||||
|
|
Scatter search for the fleet size and mix vehicle routing problem with time windows |
|
| Authors: | Patrícia Prado Belfiore Luiz Paulo Lopes Fávero |
| Affiliation: | 1.Department of Production Engineering,FEI University Center,S?o Bernardo do Campo,Brazil;2.Department of Accountancy, School of Economics, Business and Accounting,University of S?o Paulo,S?o Paulo,Brazil |
| Abstract: | 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. |
| Keywords: | Scatter search Vehicle routing Heterogeneous fleet Time windows |
| 本文献已被 SpringerLink 等数据库收录！ | |