Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/33421
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPOLLARIS, Hanne-
dc.contributor.authorJANSSENS, Gerrit K.-
dc.contributor.authorBRAEKERS, Kris-
dc.contributor.authorCARIS, An-
dc.date.accessioned2021-02-12T10:42:22Z-
dc.date.available2021-02-12T10:42:22Z-
dc.date.issued2020-
dc.date.submitted2021-02-12T08:25:34Z-
dc.identifier.citationInformation Technology and Management Science (Online), 23 , p. 55 -63-
dc.identifier.urihttp://hdl.handle.net/1942/33421-
dc.description.abstractA vehicle routing problem (VRP) with sequence-based pallet loading and axle weight constraints is introduced in the study. An Iterated Local Search (ILS) metaheuristic algorithm is used to solve the problem. Like any metaheuristic, a number of parameters need to be set before running the experiments. Parameter tuning is important because the value of the parameters may have a substantial impact on the efficacy of a heuristic algorithm. While traditionally, parameter values have been set manually using expertise and experimentation, recently several automated tuning methods have been proposed. The performance of the routing algorithm is mostly improved by using parameter tuning, but no single best tuning method for routing algorithms exists. The tuning method, Iterated F-race, is chosen because it seems to be a very robust method and it has been shown to perform well on the ILS metaheuristic and other metaheuristics. The research aims at developing an algorithm, which performs well over a wide range of network sizes.-
dc.language.isoen-
dc.rights2020 Hanne Pollaris, Gerrit K. Janssens, Kris Braekers, An Caris. This is an open access article licensed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0).-
dc.subject.otherDecision making-
dc.subject.otherevolutionary computation-
dc.subject.otheroperations research-
dc.subject.othersupply chain management-
dc.titleParameter tuning of a local search heuristic for a vehicle routing problem with loading constraints-
dc.typeJournal Contribution-
dc.identifier.epage63-
dc.identifier.spage55-
dc.identifier.volume23-
local.bibliographicCitation.jcatA1-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.doi10.7250/itms-2020-0008-
local.provider.typeCrossRef-
local.uhasselt.uhpubyes-
local.uhasselt.internationalno-
item.accessRightsOpen Access-
item.validationvabb 2022-
item.fulltextWith Fulltext-
item.fullcitationPOLLARIS, Hanne; JANSSENS, Gerrit K.; BRAEKERS, Kris & CARIS, An (2020) Parameter tuning of a local search heuristic for a vehicle routing problem with loading constraints. In: Information Technology and Management Science (Online), 23 , p. 55 -63.-
item.contributorPOLLARIS, Hanne-
item.contributorJANSSENS, Gerrit K.-
item.contributorBRAEKERS, Kris-
item.contributorCARIS, An-
crisitem.journal.issn2255-9094-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
2020 - RTU (Gerrit).pdfPublished version539.21 kBAdobe PDFView/Open
Show simple item record

Page view(s)

66
checked on Sep 7, 2022

Download(s)

66
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


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