Skip to main content
SpringerLink
Log in

Solving the Dial-a-Ride problem using genetic algorithms

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

In the Dial-a-Ride problem (DARP), customers request transportation from an operator. A request consists of a specified pickup location and destination location along with a desired departure or arrival time and capacity demand. The aim of DARP is to minimize transportation cost while satisfying customer service level constraints (Quality of Service). In this paper, we present a genetic algorithm (GA) for solving the DARP. The algorithm is based on the classical cluster-first, route-second approach, where it alternates between assigning customers to vehicles using a GA and solving independent routing problems for the vehicles using a routing heuristic. The algorithm is implemented in Java and tested on publicly available data sets. The new solution method has achieved solutions comparable with the current state-of-the-art methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7

Similar content being viewed by others

References

  • Baugh JW Jr, Kakivaya DKR and Stone JR (1998). Intractability of the Dial-a-Ride problem and a multiobjective solution using simulated annealing. Eng Optim 30: 91–124.

    Article  Google Scholar 

  • Bergvinsdottir KB (2004). The genetic algorithm for solving the Dial-a-Ride problem. Master's thesis, Informatics and Mathematical Modelling, Technical University of Denmark.

  • Borndorfer R, Grötschel M, Klostermeier F and Kuttner C (1997). Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical report, Konrad-Zuse-Zentrum für Informationstechnik, Berlin.

  • Cordeau JF, Gendrau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105–119.

    Article  Google Scholar 

  • Cordeau JF and Laporte G (2003). A tabu search heuristic for the static multi-vehicle Dial-a-Ride problem. Transport Res B-Meth 37: 579–594.

    Article  Google Scholar 

  • Homberger J and Gehring H (1999). Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37: 297–318.

    Google Scholar 

  • Jaw JJ, Odoni AR, Psaraftis HN and Wilson NHM (1986). A heuristic algorithm for the multi-vehicle advance request Dial-a-Ride problem with time windows. Transport Res B-Meth 20B(3): 243–257.

    Article  Google Scholar 

  • Jih WR, Kao CY and Hsu FYJ (2002). Using family competition genetic algorithm in pickup and delivery problem with time window constraints. In: Proceedings of the 2002 IEEE International Symposium on Intelligent Control. IEEE: Piscataway, NJ, pp. 496–501.

    Google Scholar 

  • Jorgensen RM (2002). Dial-a-Ride. PhD thesis, Center for Traffic and Transportation, Technical University of Denmark.

  • Pereira FB, Tavares J, Machado P and Costa E (2002). Gvr: A New genetic representation for the vehicle routing problem. In: Proceedings of Artificial Intelligence and Cognitive Science. 13th Irish Conference, AICS 2002, volume 2464 of Lecture Notes in Artificial Intelligence. QAD Ireland: Limerick, Irelandpp. 95–102.

    Google Scholar 

  • Reeves CR . (ed). Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill: London.

Download references

Author information

Authors and Affiliations

  1. Technical University of Denmark, Lyngby, Denmark

    R M Jorgensen, J Larsen & K B Bergvinsdottir

Authors
  1. R M Jorgensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K B Bergvinsdottir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J Larsen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jorgensen, R., Larsen, J. & Bergvinsdottir, K. Solving the Dial-a-Ride problem using genetic algorithms. J Oper Res Soc 58, 1321–1331 (2007). https://doi.org/10.1057/palgrave.jors.2602287

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2602287

Keywords

Search

Navigation