TY - GEN
T1 - A Methodological Proposal to Eliminate Ambiguities in the Comparison of Vehicle Routing Problem Solving Techniques
AU - Osaba, Eneko
AU - Carballedo, Roberto
N1 - Publisher Copyright:
© 2012 SCITEPRESS (Science and Technology Publications, Lda.).
PY - 2012
Y1 - 2012
N2 - In the field of vehicle routing problems it is very common to use benchmarks (sets of problem instances) to evaluate new solving techniques or algorithms. The purpose of these benchmarks is to compare the techniques based on the results or solutions obtained. Typically, the benchmarks include the values of optimal solutions (if they have been obtained) or values of the best known solutions. In many cases, details of how these results were obtained are not described. This may generate controversy and difficults the comparisons of techniques. This paper shows an example of ambiguity in the results of an instance of the most used VRPTW (Vehicle Routing Problem with Time Windows) bechmark. We show that when analyzing the optimal solution and the best approximate solution of a specific problem, the two results are equivalent. Finally, we will propose a set of guidelines to consider when publishing the results obtained by a new algorithm.
AB - In the field of vehicle routing problems it is very common to use benchmarks (sets of problem instances) to evaluate new solving techniques or algorithms. The purpose of these benchmarks is to compare the techniques based on the results or solutions obtained. Typically, the benchmarks include the values of optimal solutions (if they have been obtained) or values of the best known solutions. In many cases, details of how these results were obtained are not described. This may generate controversy and difficults the comparisons of techniques. This paper shows an example of ambiguity in the results of an instance of the most used VRPTW (Vehicle Routing Problem with Time Windows) bechmark. We show that when analyzing the optimal solution and the best approximate solution of a specific problem, the two results are equivalent. Finally, we will propose a set of guidelines to consider when publishing the results obtained by a new algorithm.
KW - Combinatorial Optimization
KW - Evolutionary Computing
KW - Problem Bechmarks
KW - Vehicle Routing Problem
UR - https://www.scopus.com/pages/publications/105001669268
U2 - 10.5220/0004171503100313
DO - 10.5220/0004171503100313
M3 - Conference contribution
AN - SCOPUS:105001669268
SN - 9789898565334
T3 - International Joint Conference on Computational Intelligence
SP - 310
EP - 313
BT - In Proceedings of the 4th International Joint Conference on Computational Intelligence, ECTA 2012
A2 - Rosa, Agostinho C.
A2 - Correia, António Dourado
A2 - Madani, Kurosh
A2 - Filipe, Joaquim
A2 - Kacprzyk, Janusz
PB - Science and Technology Publications, Lda
T2 - 4th International Joint Conference on Computational Intelligence, ECTA 2012
Y2 - 5 October 2012 through 7 October 2012
ER -