Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/19194
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCORSTJENS, Jeroen-
dc.contributor.authorCARIS, An-
dc.contributor.authorDEPAIRE, Benoit-
dc.date.accessioned2015-09-23T08:44:07Z-
dc.date.available2015-09-23T08:44:07Z-
dc.date.issued2015-
dc.identifier.citation29th Annual Conference of the Belgian Operations Research Society, Antwerp, Belgium, 5-6 February, 2015-
dc.identifier.urihttp://hdl.handle.net/1942/19194-
dc.description.abstractThe evaluation of heuristic performance on vehicle routing problems (VRP) is most commonly done through empirical testing on some benchmark problem set. Parameters are set using trial-and-error and testing on a limited set of standard test problems. This makes it difficult to estimate the robustness of proposed algorithms. An algorithm working well on a set of standard test problems does not necessarily perform well on any particular data set and is usually extremely sensitive to changes in the data. Therefore a scientific basis is needed for heuristic evaluation and comparison, and is the subject of this research project.-
dc.language.isoen-
dc.subject.othervehicle routing problem; heuristic algorithms; statistical evaluation-
dc.titleEvaluating and Optimizing Metaheuristic Algorithms:A step ahead in VRP research-
dc.typeConference Material-
local.bibliographicCitation.conferencedate2015, February 5-6-
local.bibliographicCitation.conferencename29th Annual Conference of the Belgian Operations Research Society-
local.bibliographicCitation.conferenceplaceAntwerp, Belgium-
local.bibliographicCitation.jcatC2-
dc.relation.references[1] Braysy, O., and Gendreau, M. (2005). Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transport Science, 39(1), 104-118. [2] Braysy, O., and Gendreau, M. (2005). Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, 39(1), 119-139. [3] Hooker, J. (1995). Testing Heuristics: We have it all wrong. Pittsburgh, USA: Graduate school of industrial administration, Carnegie Mellon University. [4] Bertsimas, D. J., and Simchi-Levi, D. (1996). A new generation of vehcile routing research: robust algorithms, addressing uncertainty. Operations Research, 44(2), 286-304. [5] S orensen, K. (2015). Metaheuristics - The Metaphor Exposed. International Transactions in Operational Research, 22(1), 3-18 [6] Rardin, R., and Uzsoy, R. (2001). Experimental evaluation of heuristic optimization algorithms: A tutorial. Journal of Heuristics, 7, 261-304.-
local.type.refereedRefereed-
local.type.specifiedConference Presentation-
item.contributorCORSTJENS, Jeroen-
item.contributorCARIS, An-
item.contributorDEPAIRE, Benoit-
item.fulltextWith Fulltext-
item.accessRightsOpen Access-
item.fullcitationCORSTJENS, Jeroen; CARIS, An & DEPAIRE, Benoit (2015) Evaluating and Optimizing Metaheuristic Algorithms:A step ahead in VRP research. In: 29th Annual Conference of the Belgian Operations Research Society, Antwerp, Belgium, 5-6 February, 2015.-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Abstract Orbel29.pdfConference material91.01 kBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check


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