IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v65y2014i7p983-1000.html
   My bibliography  Save this article

A multi-criteria large neighbourhood search for the transportation of disabled people

Author

Listed:
  • Fabien Lehuédé

    (LUNAM Université, École des Mines de Nantes, Nantes, France)

  • Renaud Masson

    (LUNAM Université, École des Mines de Nantes, Nantes, France)

  • Sophie N Parragh

    (University of Vienna, Vienna, Austria)

  • Olivier Péton

    (LUNAM Université, École des Mines de Nantes, Nantes, France)

  • Fabien Tricoire

    (1] University of Vienna, Vienna, Austria[2] NICTA/UNSW, Sydney, Australia)

Abstract

This paper addresses the problem of optimizing the transportation of disabled persons from home to specialized centres or schools. It is modelled as a Dial-a-ride problem (DARP), where several people share the same destination. Particular emphasis is placed on the objective function in order to consider several potentially conflicting interests. We propose a multi-criteria model from Multi-attribute Utility Theory based on the Choquet integral. The resulting multi-criteria DARP is then solved with a large neighbourhood search algorithm. This method includes classical destroy and repair heuristics as well as new operators exploiting the shared destination feature and criterion-specific operators. The algorithm is evaluated on a set of 14 real-world instances in the field of health care logistics, with up to 200 requests and 51 destination points.

Suggested Citation

  • Fabien Lehuédé & Renaud Masson & Sophie N Parragh & Olivier Péton & Fabien Tricoire, 2014. "A multi-criteria large neighbourhood search for the transportation of disabled people," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(7), pages 983-1000, July.
    • Handle: RePEc:pal:jorsoc:v:65:y:2014:i:7:p:983-1000
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v65/n7/pdf/jors201317a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v65/n7/full/jors201317a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. 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.
    2. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    3. Sonia Nasri & Hend Bouziri & Wassila Aggoune-Mtalaa, 2022. "An Evolutionary Descent Algorithm for Customer-Oriented Mobility-On-Demand Problems," Sustainability, MDPI, vol. 14(5), pages 1-18, March.
    4. Rossana Cavagnini & Valentina Morandi, 2021. "Implementing Horizontal Cooperation in Public Transport and Parcel Deliveries: The Cooperative Share-A-Ride Problem," Sustainability, MDPI, vol. 13(8), pages 1-20, April.
    5. TURKEŠ, Renata & SÖRENSEN, Kenneth & HVATTUM, Lars Magnus & BARRENA, Eva & CHENTLI, Hayet & COELHO, Leandro & DAYARIAN, Iman & GRIMAULT, Axel & GULLHAVE, Anders & IRIS, Çagatay & KESKIN, Merve & KIEFE, 2019. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," Working Papers 2019002, University of Antwerp, Faculty of Business and Economics.
    6. Koc, T. & Bozdag, E., 2017. "Measuring the degree of novelty of innovation based on Porter's value chain approach," European Journal of Operational Research, Elsevier, vol. 257(2), pages 559-567.
    7. Ge, Qian & Han, Ke & Liu, Xiaobo, 2021. "Matching and routing for shared autonomous vehicles in congestible network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    8. Sapan Tiwari & Neema Nassir & Patricia Sauri Lavieri, 2024. "Smart Insertion Strategies for Sustainable Operation of Shared Autonomous Vehicles," Sustainability, MDPI, vol. 16(12), pages 1-28, June.
    9. Macharis, Cathy & Bernardini, Annalia, 2015. "Reviewing the use of Multi-Criteria Decision Analysis for the evaluation of transport projects: Time for a multi-actor approach," Transport Policy, Elsevier, vol. 37(C), pages 177-186.
    10. 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.
    11. Chane-Haï Timothée & Vercraene Samuel & Monteiro Thibaud, 2023. "The assignment-dial-a-ride-problem," Health Care Management Science, Springer, vol. 26(4), pages 770-784, December.
    12. Turkeš, Renata & Sörensen, Kenneth & Hvattum, Lars Magnus, 2021. "Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search," European Journal of Operational Research, Elsevier, vol. 292(2), pages 423-442.
    13. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:65:y:2014:i:7:p:983-1000. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.