A Methodological Proposal to Eliminate Ambiguities in the Comparison of Vehicle Routing Problem Solving Techniques

Eneko Osaba, Roberto Carballedo

2012

Abstract

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.

References

  1. Banzhaf, W., 1990. The “Molecular” Traveling Salesman. Biological Cybernetics 64: 7-14.
  2. Bräysy O. and Gendreau, M., 2005. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. INFORMS Transportation Science, no. 39, pp. 104-118.
  3. Chen, C. H., Ting, C. J., 2005. A hybrid ant colony system for vehicle routing problem with time windows. Journal of the Eastern Asia Society for Transportation Studies, 6: 2822-2836.
  4. Condeau, F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F., 1999. The VRP with time windows. Technical Report Cahiers du GERAD G-99-13, École des Hautes Études Commerciales de Montréal.
  5. Cordeau J. F., Laporte G., 2003. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37: 579-594.
  6. Desrochers, M., Desrosiers, J., Solomon M. M., 1992. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operations Research, 40: 342.354.
  7. Joubert J. W., 2003. An initial heuristic for the vehicle routing and scheduling problem. MEng thesis, University of Pretoria, Pretoria.
  8. Julstrom, B.A., 1995. Very greedy Crossover in a Genetic Algorithm for the TSP. Proceedings of the 1995 ACM symposium on applied computing: 324-328.
  9. Kohl, N., Desrosiers, J., Madsen, O. B. G., Solomon, M. M., and Soumis, F., 1999. 2-Path Cuts for the Vehicle Routing Problem with Time Windows. Transportation Science, Vol. 33 (1), 101-116.
  10. Lau, H. C., Sim, M., Teo, K. M. 2003. Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research, 148: 559-569.
  11. Lawler, E. L., Lenstra, J. K., Rinnooy, K., Shmoys, D. B., 1985. The traveling Salesman Problem: A guided tour of combinatorial optimization. Willey - Interscience Publication.
  12. Reinelt, G., 1991. TSPLIB - A traveling salesman problem library. ORSA Journal on Computing, 3: 376 - 384.
  13. Rochat, Y. And Taillard, E. D. 1995 Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1, 147-167.
  14. Solomon, M. M., 1987. Algorithms for the vehicle routing and scheduling problems with time windows. INFORMS Operations Research, 35: 254-265.
  15. Solomon, M. M., 2005. VRPTW Bechmark Problems. http://web.cba.neu.edu/msolomon/problems.htm.
Download


Paper Citation


in Harvard Style

Osaba E. and Carballedo R. (2012). A Methodological Proposal to Eliminate Ambiguities in the Comparison of Vehicle Routing Problem Solving Techniques . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 310-313. DOI: 10.5220/0004171503100313


in Bibtex Style

@conference{ecta12,
author={Eneko Osaba and Roberto Carballedo},
title={A Methodological Proposal to Eliminate Ambiguities in the Comparison of Vehicle Routing Problem Solving Techniques},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={310-313},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004171503100313},
isbn={978-989-8565-33-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - A Methodological Proposal to Eliminate Ambiguities in the Comparison of Vehicle Routing Problem Solving Techniques
SN - 978-989-8565-33-4
AU - Osaba E.
AU - Carballedo R.
PY - 2012
SP - 310
EP - 313
DO - 10.5220/0004171503100313