IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v31y1997i1p60-71.html
   My bibliography  Save this article

Heuristic Algorithms for the Handicapped Persons Transportation Problem

Author

Listed:
  • Paolo Toth

    (Dipartimento di Elettronica, Informatica e Sistemistica, Universitá di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy)

  • Daniele Vigo

    (Dipartimento di Elettronica, Informatica e Sistemistica, Universitá di Bologna, Viale Risorgimento 2, 40136 Bologna, Italy)

Abstract

We examine the problem of determining an optimal schedule for a fleet of vehicles used to transport handicapped persons in an urban area. The problem is a generalization of the well-known advance-request Pickup and Delivery Problem with Time Windows. Due to the high level of service required by this kind of transport, several additional operational constraints must be considered. The problem is NP-hard in the strong sense, and exact approaches for the solution of real-life problems (typically with hundreds of users to be transported) are not practicable. We describe a fast and effective parallel insertion heuristic algorithm which is able to determine good solutions for real-world instances of the problem in a few seconds on a personal computer. We also present a Tabu Thresholding procedure which can be used to improve the starting solution obtained by the insertion algorithm. The application of the proposed procedures to a set of real-life instances for the city of Bologna, involving about 300 trips each, is also discussed. The heuristic algorithms obtain very good results compared with the hand-made schedules, both in terms of service quality (all the service requirements are met) and overall cost.

Suggested Citation

  • Paolo Toth & Daniele Vigo, 1997. "Heuristic Algorithms for the Handicapped Persons Transportation Problem," Transportation Science, INFORMS, vol. 31(1), pages 60-71, February.
    • Handle: RePEc:inm:ortrsc:v:31:y:1997:i:1:p:60-71
    DOI: 10.1287/trsc.31.1.60
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.31.1.60
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.31.1.60?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
    ---><---

    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:inm:ortrsc:v:31:y:1997:i:1:p:60-71. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.