Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/25914
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCORSTJENS, Jeroen-
dc.contributor.authorCARIS, An-
dc.contributor.authorDEPAIRE, Benoit-
dc.date.accessioned2018-04-16T13:37:16Z-
dc.date.available2018-04-16T13:37:16Z-
dc.date.issued2018-
dc.identifier.citationThe 32nd Conference of the Belgian Operational Research Society (ORBEL32), Liège, Belgium, 01-02/02/2018-
dc.identifier.urihttp://hdl.handle.net/1942/25914-
dc.description.abstractHeuristics are most commonly evaluated using benchmark problems and comparing performance results with other methods. The aim is to be better than the competition. An investigation focused on understanding a heuristic method is rarely performed. We analyse the performance difference between two configurations of a large neighbourhood search algorithm applied on instances of the VRPTW and are able to explain the performance gap after analysing the destroy and repair process.-
dc.language.isoen-
dc.subject.othermetaheuristics; statistical analysis; vehicle routing; large neighbourhood search-
dc.titleAn analysis on the destroy and repair process in large neighbourhood search applied on the vehicle routing problem with time windows-
dc.typeConference Material-
local.bibliographicCitation.conferencedate01-02/02/2018-
local.bibliographicCitation.conferencenameThe 32nd Conference of the Belgian Operational Research Society (ORBEL32)-
local.bibliographicCitation.conferenceplaceLiège, Belgium-
local.bibliographicCitation.jcatC2-
dc.relation.referencesCorstjens, J., Depaire, B., Caris, A., & Sörensen, K. (2016). Analysing metaheuristic algorithms for the vehicle routing problem with time windows. In Verolog 2016 proceedings, 89. Fawcett, C., & Hoos, H. (2015). Analysing differences between algorithm configurations through ablation. Journal of Heuristics, 22(4), 431-458. Hutter, F., Hoos, H., & Leyton-Brown, K. (2015). Identifying key algorithm parameters and instance features using forward selection. Lecture Notes in Computer Science, 7997, 364-381. Hutter, F., Hoos, H., & Leyton-Brown, K. (2015). An efficient approach for assessing hyperparameter importance. International Conference on Machine Learning, 754-762. Rardin, R. L., & Uzsoy, R. (2001). Experimental evaluation of heuristic optimization algorithms: A tutorial. Journal of Heuristics, 7(3), 261-304.-
local.type.refereedNon-Refereed-
local.type.specifiedPaper-
item.fulltextWith Fulltext-
item.contributorCORSTJENS, Jeroen-
item.contributorCARIS, An-
item.contributorDEPAIRE, Benoit-
item.accessRightsOpen Access-
item.fullcitationCORSTJENS, Jeroen; CARIS, An & DEPAIRE, Benoit (2018) An analysis on the destroy and repair process in large neighbourhood search applied on the vehicle routing problem with time windows. In: The 32nd Conference of the Belgian Operational Research Society (ORBEL32), Liège, Belgium, 01-02/02/2018.-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Abstract Orbel 32.pdfConference material58.04 kBAdobe PDFView/Open
Show simple item record

Page view(s)

34
checked on Sep 7, 2022

Download(s)

8
checked on Sep 7, 2022

Google ScholarTM

Check


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