Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/23720
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPOLLARIS, Hanne-
dc.contributor.authorBRAEKERS, Kris-
dc.contributor.authorCARIS, An-
dc.contributor.authorJANSSENS, Gerrit K.-
dc.contributor.authorLimbourg, Sabine-
dc.date.accessioned2017-05-18T06:51:45Z-
dc.date.available2017-05-18T06:51:45Z-
dc.date.issued2017-
dc.identifier.citationNETWORKS, 69(3), p. 304-316-
dc.identifier.issn0028-3045-
dc.identifier.urihttp://hdl.handle.net/1942/23720-
dc.description.abstractIn this article an Iterated Local Search algorithm for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is presented. Axle weight limits impose a great challenge for transportation companies. Yet, the literature on the incorporation of axle weight constraints in vehicle routing models is very scarce. The effect of introducing axle weight constraints in a CVRP on total routing cost is analyzed. Results show that integrating axle weight constraints does not lead to a large cost increase. However, not including axle weight constraints in the planning process may induce major axle weight violations.-
dc.description.sponsorshipFunded by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office (COMEX project: Combinatorial Optimization: Metaheuristics and Exact methods). The computational resources and services used in this work were provided by the VSC (Flemish Supercomputer Center), funded by the Research Foundation - Flanders (FWO) and the Flemish Government - department EWI.-
dc.language.isoen-
dc.rights© 2017 Wiley Periodicals, Inc.-
dc.subject.othervehicle Routing Problem; axle weight constraints; routing & loading; iterated local search; sequence-based loading; capacitated vehicle routing problem-
dc.titleIterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints-
dc.typeJournal Contribution-
dc.identifier.epage316-
dc.identifier.issue3-
dc.identifier.spage304-
dc.identifier.volume69-
local.bibliographicCitation.jcatA1-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.type.programmeVSC-
dc.identifier.doi10.1002/net.21738-
dc.identifier.isi000402153000006-
item.fulltextWith Fulltext-
item.fullcitationPOLLARIS, Hanne; BRAEKERS, Kris; CARIS, An; JANSSENS, Gerrit K. & Limbourg, Sabine (2017) Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints. In: NETWORKS, 69(3), p. 304-316.-
item.contributorPOLLARIS, Hanne-
item.contributorBRAEKERS, Kris-
item.contributorCARIS, An-
item.contributorJANSSENS, Gerrit K.-
item.contributorLimbourg, Sabine-
item.validationecoom 2018-
item.accessRightsOpen Access-
crisitem.journal.issn0028-3045-
crisitem.journal.eissn1097-0037-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
DS_PollarisBraekersetal_ILS for the CVRP with sequence-based pallet loading and axle weight constraints.pdfPeer-reviewed author version447.17 kBAdobe PDFView/Open
Pollaris_et_al-2017-Networks.pdf
  Restricted Access
Published version676.86 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


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