Empirical Analysis of Optimization Methods for the Real-World Dial-a-Ride Problem

  • Dilek ArıkanEmail author
  • Çetin Öztoprak
  • Sanem Sarıel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10199)


This paper deals with solving the Dial-a-Ride Problem (DARP) for an on-demand delivery start-up company which delivers products to its customers from their corresponding pick-up points within guaranteed time intervals. The primary goal of the company is to minimize its operational costs while fulfilling the orders under the constraints on time window, duration, carrier capacity and ride time. This problem is formulated as the real-world DARP, and two methods are empirically evaluated by using Mixed Integer Programming (MIP) and Genetic Algorithm (GA) frameworks. The experiments are done on the simulated data provided by the company. The results show that a heuristic approach is more suitable for the real-world problem to meet the time window limitations.


Dial-a-Ride Problem Combinatorial optimization Genetic Algorithm Mixed integer programming Transportation 


  1. 1.
    Baugh Jr., J.W., Kakivaya, G.K.R., Stone, J.R.: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng. Optim. 30(2), 91–123 (1998)CrossRefGoogle Scholar
  2. 2.
    Bergvinsdottir, K., Larsen, J., Jørgensen, R.: Solving the dial-a-ride problem using genetic algorithms. Informatics and Mathematical Modelling, Technical University of Denmark, DTU (2004)Google Scholar
  3. 3.
    Bodin, L.D., Sexton, T.: The multi-vehicle subscriber dial-a-ride problem. TIMS Stud. Manage. Sci. 2, 73–86 (1986)Google Scholar
  4. 4.
    Cordeau, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B Methodol. 37(6), 579–594 (2003)CrossRefGoogle Scholar
  5. 5.
    Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573–586 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Røpke, S.: The dial a ride problem (DARP). Ph.D. thesis, Datalogisk Institut Københavns Universitet (2005).
  7. 7.
    Sariel, S.: An integrated planning, scheduling and execution framework for multi-robot cooperation and coordination. Dissertation, Istanbul Technical University (2007).
  8. 8.
    Van Brummelen, G.: Heavenly Mathematics: The Forgotten Art of Spherical Trigonometry. Princeton University Press (2013).
  9. 9.
    Williams, H.P.: Integer programming, pp. 25–70. Springer US, Boston, MA (2009). doi: 10.1007/978-0-387-92280-5_2

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Dilek Arıkan
    • 1
    Email author
  • Çetin Öztoprak
    • 2
  • Sanem Sarıel
    • 1
  1. 1.Department of Computer EngineeringIstanbul Technical UniversityIstanbulTurkey
  2. 2.KapgelIstanbulTurkey

Personalised recommendations