Journal
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Volume 27, Issue 1, Pages 168-196Publisher
WILEY
DOI: 10.1111/itor.12631
Keywords
algorithm performance; statistical evaluation; understanding; vehicle routing problem with time windows; large neighborhood search; metaheuristics
Funding
- National Bank of Belgium
- Interuniversity Attraction Poles Programme by the Belgian Science Policy Office (research project COMEX, Combinatorial Optimization: Metaheuristics Exact Methods)
- Research Foundation -Flanders (FWO)
- Flemish Government Department EWI
Ask authors/readers for more resources
The field of combinatorial optimization has inspired the development of a large number of heuristic solution procedures. These methods are commonly assessed using a competitive evaluation methodology that may give an indication of which algorithm has a better performance. A next step in the experimental analysis is to uncover why one algorithm performs better. Which elements are responsible for good or bad performance? How does the performance of elements vary across the design space? What is the influence of the specific problem instance that is being solved? We focus on gaining a better understanding of heuristic algorithm performance and demonstrate that the application of a proper statistical methodology can provide researchers insight into how performance is affected by the different algorithm parameters and components. As an example, we apply a multilevel statistical analysis to a large neighborhood search algorithm for the vehicle routing problem with time windows.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available