Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Applications of Evolutionary Computation (EvoApplications 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10199))

Included in the following conference series:

  • 1796 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/.

  2. 2.

    https://netbeans.org/.

  3. 3.

    https://www.java.com.

References

  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)

    Article  Google Scholar 

  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. Bodin, L.D., Sexton, T.: The multi-vehicle subscriber dial-a-ride problem. TIMS Stud. Manage. Sci. 2, 73–86 (1986)

    Google Scholar 

  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)

    Article  Google Scholar 

  5. Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573–586 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Røpke, S.: The dial a ride problem (DARP). Ph.D. thesis, Datalogisk Institut Københavns Universitet (2005). https://www.itu.dk/people/pagh/CAOS/DARP.pdf

  7. Sariel, S.: An integrated planning, scheduling and execution framework for multi-robot cooperation and coordination. Dissertation, Istanbul Technical University (2007). http://web.itu.edu.tr/sariel/thesis/sariel_PhD_Thesis_2007.pdf

  8. Van Brummelen, G.: Heavenly Mathematics: The Forgotten Art of Spherical Trigonometry. Princeton University Press (2013). https://books.google.co.uk/books?id=0BCCz8Sx5wkC

  9. Williams, H.P.: Integer programming, pp. 25–70. Springer US, Boston, MA (2009). doi:10.1007/978-0-387-92280-5_2

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Istanbul Technical University, Istanbul, Turkey

    Dilek Arıkan & Sanem Sarıel

  2. Kapgel, Istanbul, Turkey

    Çetin Öztoprak

Authors
  1. Dilek Arıkan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Çetin Öztoprak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sanem Sarıel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dilek Arıkan .

Editor information

Editors and Affiliations

  1. Politecnico di Torino, Turin, Italy

    Giovanni Squillero

  2. Edinburgh Napier University, Edinburgh, United Kingdom

    Kevin Sim

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Arıkan, D., Öztoprak, Ç., Sarıel, S. (2017). Empirical Analysis of Optimization Methods for the Real-World Dial-a-Ride Problem. In: Squillero, G., Sim, K. (eds) Applications of Evolutionary Computation. EvoApplications 2017. Lecture Notes in Computer Science(), vol 10199. Springer, Cham. https://doi.org/10.1007/978-3-319-55849-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-55849-3_38

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-55848-6

  • Online ISBN: 978-3-319-55849-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation