Haibing Li
ABSTRACT
In this paper, we propose a metaheuristic based on annealing-like restarts to diversify and intensify local searches for solving the vehicle routing problem with time windows (VRPTW). Using the Solomon's benchmark instances for the problem, our method obtained 7 new best results and equaled 19 other best results. Extensive comparisons indicate that our method is comparable to the best published literatures.
- M. Savelsbergh. Local search for routing problems with time windows. Annals of Operations Research, 4:285-305, 1985.Google Scholar
Cross Ref
- M. Desrochers, J. Desrosiers, and M. Solomon. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40:342-354, 1992. Google ScholarDigital Library
- M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constrains. Operations Research, 35:254-264, 1987. Google ScholarDigital Library
- M. Fisher, K. Jörnsten, and O. Madsen. Vehicle routing with time windows: Two optimization algorithms. Operations Research, 45:488-492, 1997.Google ScholarDigital Library
- Y. Dumas, J. Desrosiers, E. Gelinas, and M. Solomon. An optimal algorithm for the traveling salesman problem with time windows. Operations Research, 43:367-371, 1995.Google ScholarDigital Library
- N. Kohl and O. Madsen. An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Operations Research, 45:395-406, 1997.Google ScholarDigital Library
- A. Kolen, A. Rinnooy, and H. Trienekens. Vehicle routing with time windows. Operations Research, 35:266-273, 1987. Google ScholarDigital Library
- J. Potvin and J. Rousseau. A parallel route building algorithms for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research, 66:331-340, 1993.Google ScholarCross Ref
- M. Savelsbergh. The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing, 4:146-154, 1992.Google ScholarCross Ref
- J. Potvin and J. Rousseau. An exchange heuristic for routing problems with time windows. Journal of Operational Research Society, 46:1433-1446, 1995.Google ScholarCross Ref
- E. Taillard, P. Badeau, M. Gendreau, F. Geurtin, and J. Potvin. A tabu search heuristic for the vehicle routing problem with time windows. Transportation Science, 31:170-186, 1997.Google ScholarDigital Library
- R. Russell. Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science, 29:156-166, 1995.Google ScholarDigital Library
- Y. Rochat and F. Semet. A tabu search approach for delivering pet food and flour in switzerland. Journal of Operational Research Society, 45:1233-1246, 1994.Google ScholarCross Ref
- Y. Rochat and E. Taillard. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1:147-167, 1995.Google ScholarDigital Library
- J. Potvin, B. Garcia, and L. Rousseau. The vehicle routing problem with time windows - part 1: Tabu search. INFORMS Journal on Computing, 8:158-184, 1996.Google ScholarDigital Library
- W. Chiang and R. Russell. A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS Journal on Computing, 9:417-430, 1997.Google ScholarDigital Library
- J. Cordeau, G. Laporte, and A. Mercier. A unified tabu search heuristic for vehicle routing problems with time windows. Technical Report CRT-00-03, Center for Research on Transportation, Montreal, Canada, 2000.Google Scholar
- W. Chiang and R. Russell. Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research, 63:3-27, 1996.Google ScholarCross Ref
- S. Thangiah. Vehicle routing with time windows using genetic algorithms. Technical Report SRU-CPSC-TR-93-23, Computer Science Department, Slippery Rock University, Slippery Rock, PA, 1993.Google Scholar
- J. Potvin and S. Bengio. The vehicle routing problem with time windows - part 2: Genetic search. INFORMS Journal on Computing, 8:165-172, 1996.Google ScholarDigital Library
- J. Homberger and H. Gehring. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR, 37:297-318, 1999.Google Scholar
- S. Thangiah, I. Osman, and T. Sun. Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical Report UKC/OR94/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK, 1994.Google Scholar
- J. Desrochers, J. Lenstra, M. Savelsbergh, and F. Soumis. Vehicle routing with time windows: Optimization and approximation. In Vehicle Routing: Methods and Studies. Elsevier Science Publishers, North-Holland, 1988.Google Scholar
- J. Desrosiers, Y. Dumas, M. Solomon, and F. Sormis. Time constrained routing and scheduling. In Handbooks in Operations Research and Management Science: Network Routing. Elsevier Science Publishers, Amsterdam, 1995.Google Scholar
- J. Cordeau, G. Desaulniers, J. Desrosiers, M. Solomon, and F. Soumis. The vrp with time windows. In The Vehicle Routing Problem. SIAM, Philadelphia, PA, Forthcoming. Google ScholarDigital Library
- B. Backer, V. Furnon, P. Shaw, P. Kilby, and P. Prosser. Solving vehicle routing problem using constraint programming and metaheuristics. Journal of Heuristics, 6:501-523, 2000. Google ScholarDigital Library
- L. Rousseau, M. Gendreau, and G. Pesant. Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics, Forthcoming. Google ScholarDigital Library
- H. Li and A. Lim. A metaheuristic for the pickup and delivery problem with time windows. In ICTAI 2001, November 2001. Google ScholarDigital Library
Index Terms
- Local search with annealing-like restarts to solve the vehicle routing problem with time windows
Recommendations
An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries
Vehicle routing problem with simultaneous and mixed pickups and deliveries have been addressed.An adaptive local search algorithm is proposed to solve the problems.The proposed approach generates high-quality solutions to the benchmark instances in ...
Combinatorial Optimization Method Based on Hierarchical Structure in Solution Space
In this paper, we introduce a new concept of hierarchical structure into solution space of a combinatorial optimization problem, and develop a novel combinatorial optimization method based on the concept. The introduction of the above new hierarchical ...
The Multiple Trip Vehicle Routing Problem with Backhauls
In this paper a new VRP variant the Multiple Trip Vehicle Routing Problem with Backhauls (MT-VRPB) is investigated. The classical MT-VRP model is extended by including the backhauling aspect. An ILP formulation of the MT-VRPB is first presented and ...
Comments