Scatter search for the fleet size and mix vehicle routing problem with time windows
Nenhuma Miniatura disponível
Citações na Scopus
21
Tipo de produção
Artigo
Data
2007-11-05
Autores
BELFIORE, P. P.
FÁVERO, L. P. L.
FÁVERO, L. P. L.
Orientador
Periódico
Central European Journal of Operations Research
Título da Revista
ISSN da Revista
Título de Volume
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.
Texto completo (DOI)
Palavras-chave
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.