Skip to main content
Log in

An effective and fast heuristic for the Dial-a-Ride problem

  • Regular Paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

Dial-a-Ride is an emerging transport system, in which a fleet of vehicles, without fixed routes and schedules, carries people from the desired pickup point to the desired delivery point, during a pre-specified time interval. It can be modeled as an \(\mathcal{NP}\)-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this problem are too limited to tackle real-life instances (hundred of trips), therefore heuristics are needed. The heuristic method proposed in this paper builds an auxiliary graph and then solves an assignment problem on this graph. The auxiliary graph is obtained by replacing pairs of nodes with a single one and associating an ad hoc cost function to the new set of arcs. Two different simple methods are employed to transform the infeasible solution given by the assignment problem into a feasible one. The proposed algorithms have been tested on instances created using the Milan network and shown to be fast and effective.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amaldi E, Colorni A, Fiorenzo Catalano S (2000) Feasibility study of a dial-a-ride system for a suburban area of milan. Ric Oper, 30(94–95):5–28

    Google Scholar 

  • Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9: 375–382

    Article  Google Scholar 

  • Cordeau J-F (2003) A branch and cut algorithm for a dial-a-ride problem. Oper Res (in press)

  • Cordeau J-F, Laporte G (2003a) The dial-a-ride problem (darp): variants, modeling issues and algorithms. 4OR 1:89–101

    Google Scholar 

  • Cordeau J-F, Laporte G (2003b) A tabu search heuristics for the static multi-vehicle dial-a-ride problem. Transp Res B 37:579–594

    Article  Google Scholar 

  • Cordone R, Wolfler Calvo R (1996) Note about time window constraints in routing problems. Internal report 96-005. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano

  • Desrosiers J, Dumas Y, Soumis F (1986) A dynamic programming solution of the large-scale single-vehicle Dial-a-Ride problem with time windows. Am J Math Manag Sci 6

  • Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. In: Network routing. Handbooks in operations research and management science, vol 8, pp 35–139. North-Holland

  • Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54:7–22

    Article  Google Scholar 

  • Ioachim I, Desrosiers J, Dumas Y, Solomon MM, Villeneuve D (1995) A request clustering algorithm for dorr-to-door handicapped transportation. Transp Sci 29:63–78

    Google Scholar 

  • Jaw J, Odoni A, Psaraftis H, Wilson N (1986) A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transp Res 20B:243–257

    Article  Google Scholar 

  • Kontoravdis G, Bard JF (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7:10–23

    Google Scholar 

  • Madsen OBG, Ravn HF, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities and multiple objectives. Ann Oper Res 60:193–208

    Article  Google Scholar 

  • Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulations and traveling salesman problems. J Assoc Comput Mach 7:326–329

    Google Scholar 

  • Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130–154

    Google Scholar 

  • Psaraftis HN (1983) An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp Sci 17(3):351–357

    Article  Google Scholar 

  • Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4:285–305

    Article  Google Scholar 

  • Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transp Sci 29(1):17–29

    Google Scholar 

  • Sexton T, Choi Y (1986) Pick-up and delivery of partial loads sith time windows. Am J Math Manag Sci 6:369–398

    Google Scholar 

  • Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31(1):60–71

    Google Scholar 

  • Wolfler Calvo R (2000) A new heuristic for the traveling salesman problem with time windows. Transp Sci 34(1):113–124

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roberto Wolfler Calvo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Calvo, R.W., Colorni, A. An effective and fast heuristic for the Dial-a-Ride problem. 4OR 5, 61–73 (2007). https://doi.org/10.1007/s10288-006-0018-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-006-0018-0

Keywords

MSC classification

Navigation