BELFIORE, P. P.FÁVERO, L. P. L.2022-01-122022-01-122007-11-05BELFIORE, 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.1613-9178https://repositorio.fei.edu.br/handle/FEI/4336This 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.Acesso RestritoArtigo10.1007/s10100-007-0036-9Heterogeneous fleetScatter searchTime windowsVehicle routing