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

Página do item simplificado
dc.contributor.authorBELFIORE, P. P.
dc.contributor.authorFÁVERO, L. P. L.
dc.date.accessioned2022-01-12T22:05:24Z
dc.date.available2022-01-12T22:05:24Z
dc.date.issued2007-11-05
dc.description.abstractThis 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.
dc.description.firstpage351
dc.description.issuenumber4
dc.description.lastpage368
dc.description.volume15
dc.identifier.citationBELFIORE, 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.
dc.identifier.doi10.1007/s10100-007-0036-9
dc.identifier.issn1613-9178
dc.identifier.urihttps://repositorio.fei.edu.br/handle/FEI/4336
dc.relation.ispartofCentral European Journal of Operations Research
dc.rightsAcesso Restrito
dc.subject.otherlanguageHeterogeneous fleet
dc.subject.otherlanguageScatter search
dc.subject.otherlanguageTime windows
dc.subject.otherlanguageVehicle routing
dc.titleScatter search for the fleet size and mix vehicle routing problem with time windows
dc.typeArtigo
fei.scopus.citations21
fei.scopus.eid2-s2.0-44849096579
fei.scopus.updated2024-07-01
fei.scopus.urlhttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=44849096579&origin=inward
Arquivos
Coleções
Artigos