Advertisement

Large Neighborhood Search for Dial-a-Ride Problems

  • Siddhartha Jain
  • Pascal Van Hentenryck
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6876)

Abstract

Dial-a-Ride problems (DARPs) arise in many urban transportation applications. The core of a DARP is a pick and delivery routing with multiple vehicles in which customers have ride-time constraints and routes have a maximum duration. This paper considers DARPs for which the objective is to minimize the routing cost, a complex optimization problem which has been studied extensively in the past. State-of-the-art approaches include sophisticated tabu search and variable neighborhood search. This paper presented a simple constraint-based large neighborhood search, which uses constraint programming repeatedly to find good reinsertions for randomly selected sets of customers. Experimental evidence shows that the approach is competitive in finding best-known solutions and reaches high-quality solutions significantly faster than the state of the art.

Keywords

Tabu Search Constraint Programming Insertion Point Variable Neighborhood Search Large Neighborhood 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baugh, J., John, W.K., Reddy, G.K., Stone, J.R.: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Engineering Optimization 30, 91–123 (1998)CrossRefGoogle Scholar
  2. 2.
    Bent, R., Hentenryck, P.V.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33, 875–893 (2006)CrossRefzbMATHGoogle Scholar
  3. 3.
    Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38, 515–530 (2004)CrossRefGoogle Scholar
  4. 4.
    Berbeglia, G., Cordeau, J.-F., Laporte, G.: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. Submitted to INFORMS Journal on Computing (2010)Google Scholar
  5. 5.
    Berbeglia, G., Pesant, G., Rousseau, L.-M.: Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science (2010)Google Scholar
  6. 6.
    Berbeglia, G., Pesant, G., Rousseau, L.-M.: Feasibility of the pickup and delivery problem with fixed partial routes: A complexity analysis. Submitted to Transportation Science (2010)Google Scholar
  7. 7.
    Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological 37(6), 579–594 (2003)CrossRefGoogle Scholar
  8. 8.
    Cordeau, J.-F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research 153, 29–46 (2007), 10.1007/s10479-007-0170-8MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65(1-3), 223–253 (1996); First International Colloquium on Graphs and OptimizationMathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Jorgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society 58(11), 1321–1331 (2007)CrossRefzbMATHGoogle Scholar
  11. 11.
    Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research 37(6), 1129–1138 (2010)CrossRefzbMATHGoogle Scholar
  12. 12.
    Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  13. 13.
    Toth, P., Vigo, D.: Heuristic algorithms for the handicapped persons transportation problem. Transportation Science, 60–71 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Siddhartha Jain
    • 1
  • Pascal Van Hentenryck
    • 1
  1. 1.Department of Computer ScienceBrown UniversityU.S.A.

Personalised recommendations