A methodological proposal to eliminate ambiguities in the comparison of vehicle routing problem solving techniques

IJCCI 2012 - Proceedings of the 4th International Joint Conference on Computational Intelligence

Volumn , Issue , 2012, Pages 310-313

  Osaba, Eneko ^a   Carballedo, Roberto ^a  

^a UNIVERSITY OF DEUSTO   (Spain)

Author keywords

Combinatorial Optimization; Evolutionary Computing; Problem Bechmarks; Vehicle Routing Problem

Indexed keywords

APPROXIMATE SOLUTION; EVOLUTIONARY COMPUTING; OPTIMAL SOLUTIONS; PROBLEM BECHMARKS; PROBLEM INSTANCES; SPECIFIC PROBLEMS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; OPTIMAL SYSTEMS; ROUTING ALGORITHMS;

NETWORK ROUTING;

EID: 84877853757     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

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.