Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/2566
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDullaert, W-
dc.contributor.authorJANSSENS, Gerrit K.-
dc.contributor.authorSorensen, K-
dc.contributor.authorVernimmen, B-
dc.date.accessioned2007-11-15T10:45:41Z-
dc.date.available2007-11-15T10:45:41Z-
dc.date.issued2002-
dc.identifier.citationJOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 53(11). p. 1232-1238-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/1942/2566-
dc.description.abstractIn the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly higher than that of any previous heuristic approach and therefore likely to achieve better solutions to practical routing problems.-
dc.language.isoen-
dc.publisherPALGRAVE PUBLISHERS LTD-
dc.subject.othervehicle routing; heuristics; time windows; heterogeneous fleet-
dc.titleNew heuristics for the fleet size and mix vehicle routing problem with time windows-
dc.typeJournal Contribution-
dc.identifier.epage1238-
dc.identifier.issue11-
dc.identifier.spage1232-
dc.identifier.volume53-
local.format.pages7-
local.bibliographicCitation.jcatA1-
dc.description.notesUniv Antwerp, Ufsia Ruca Fac Appl Econ, B-2000 Antwerp, Belgium. Limburgs Univ Centrum, Diepenbeek, Belgium.Dullaert, W, Univ Antwerp, Ufsia Ruca Fac Appl Econ, Prinsstr 13, B-2000 Antwerp, Belgium.-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.doi10.1057/palgrave.jors.2601422-
dc.identifier.isi000178867800007-
item.contributorDullaert, W-
item.contributorJANSSENS, Gerrit K.-
item.contributorSorensen, K-
item.contributorVernimmen, B-
item.accessRightsClosed Access-
item.validationecoom 2003-
item.fullcitationDullaert, W; JANSSENS, Gerrit K.; Sorensen, K & Vernimmen, B (2002) New heuristics for the fleet size and mix vehicle routing problem with time windows. In: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 53(11). p. 1232-1238.-
item.fulltextNo Fulltext-
crisitem.journal.issn0160-5682-
crisitem.journal.eissn1476-9360-
Appears in Collections:Research publications
Show simple item record

SCOPUSTM   
Citations

49
checked on Jan 10, 2026

WEB OF SCIENCETM
Citations

40
checked on Jan 13, 2026

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.