Scatter search for the fleet size and mix vehicle routing problem with time windows
N/D
Tipo de produção
Artigo
Data de publicação
2007-11-05
Texto completo (DOI)
Periódico
Central European Journal of Operations Research
Editor
Texto completo na Scopus
Citações na Scopus
21
Autores
BELFIORE, P. P.
FÁVERO, L. P. L.
Orientadores
Resumo
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. © 2007 Springer-Verlag.
Citação
BELFIORE, P. P.; FÁVERO, L. P. L. Scatter search for the fleet size and mix vehicle routing problem with time windows. Central European Journal of Operations Research, v. 15, n. 4, p. 351-368, November, 2007.
Palavras-chave
Keywords
Heterogeneous fleet; Scatter search; Time windows; Vehicle routing