IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v10y2011i2p214-239.html
   My bibliography  Save this article

A tabu search heuristic for solving the multi-depot, multi-vehicle, double request dial-a-ride problem faced by a healthcare organisation

Author

Listed:
  • Emanuel Melachrinoudis
  • Hokey Min

Abstract

In the Center for Addictive Behavior Health and Recovery Services, Inc. (CAB) based in Massachusetts, a dial-a-ride system has been in operation to serve outpatients such as drug and alcohol addicts requesting both delivery and pickup services through telephone calls. As the number of outpatients continues to increase with constrained vehicle capacity and operating budget, CAB copes with the onerous task of minimising the service disruptions and vehicle operating costs. To handle this challenging task, we developed an integer programming model and a tabu search heuristic for solving that model. A series of computational experiments that we made through the real-world problems encountering CAB substantiated the practicality of the proposed model and tabu search heuristic. In addition, the solution quality (accuracy) and computational efficiency of the tabu search heuristic were verified by comparing its test result to those of the branch and bound algorithm.

Suggested Citation

  • Emanuel Melachrinoudis & Hokey Min, 2011. "A tabu search heuristic for solving the multi-depot, multi-vehicle, double request dial-a-ride problem faced by a healthcare organisation," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 10(2), pages 214-239.
    • Handle: RePEc:ids:ijores:v:10:y:2011:i:2:p:214-239
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=38585
    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. 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.

    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:ids:ijores:v:10:y:2011:i:2:p:214-239. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    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.