IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v30y2013i01ns0217595912500467.html
   My bibliography  Save this article

A Hybrid Greedy Randomized Adaptive Search Heuristic To Solve The Dial-A-Ride Problem

Author

Listed:
  • FRANCESCA GUERRIERO

    (Dipartimento di Ingegneria Meccanica, Energetica e Gestionale, Università della Calabria, Via P. Bucci 41C, 87030 Rende (Cosenza), Italy)

  • MARIA ELENA BRUNI

    (Dipartimento di Ingegneria Meccanica, Energetica e Gestionale, Università della Calabria, Via P. Bucci 41C, 87030 Rende (Cosenza), Italy)

  • FRANCESCA GRECO

    (Dipartimento di Ingegneria Meccanica, Energetica e Gestionale, Università della Calabria, Via P. Bucci 41C, 87030 Rende (Cosenza), Italy)

Abstract

This paper presents a hybrid metaheuristic for solving the static dial-a-ride problem with heterogeneous vehicles and fixed costs. The hybridization combines a reactive greedy randomized adaptive search, used as outer scheme, with a tabu search heuristic in the local search phase. The algorithm is evaluated on well-known instances taken from the literature and on a set of randomly generated test problems, varying in the number of customers. Extensive computational results show the effectiveness of the hybrid approach in terms of trade-off between solution quality and computational time.

Suggested Citation

  • Francesca Guerriero & Maria Elena Bruni & Francesca Greco, 2013. "A Hybrid Greedy Randomized Adaptive Search Heuristic To Solve The Dial-A-Ride Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 30(01), pages 1-17.
  • Handle: RePEc:wsi:apjorx:v:30:y:2013:i:01:n:s0217595912500467
    DOI: 10.1142/S0217595912500467
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595912500467
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0217595912500467?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    2. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    3. Zhang, Zhenzhen & Liu, Mengyang & Lim, Andrew, 2015. "A memetic algorithm for the patient transportation problem," Omega, Elsevier, vol. 54(C), pages 60-71.
    4. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
    5. van Engelen, Matti & Cats, Oded & Post, Henk & Aardal, Karen, 2018. "Enhancing flexible transport services with demand-anticipatory insertion heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 110-121.
    6. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    7. Bruni, M.E. & Guerriero, F. & Beraldi, P., 2014. "Designing robust routes for demand-responsive transport systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 1-16.
    8. Braekers, Kris & Caris, An & Janssens, Gerrit K., 2014. "Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 166-186.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:30:y:2013:i:01:n:s0217595912500467. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.