Advanced Search
MyIDEAS: Login

A dynamic day-ahead paratransit planning problem

Contents:

Author Info

  • Cremers, Marloes
  • Klein Haneveld, Wim
  • van der Vlerk, Maarten

    (Groningen University)

Registered author(s):

    Abstract

    Abstract We consider a dynamic planning problem for the transport of elderly and disabled people. The focus is on a decision to make one day ahead: which requests to serve with own vehicles, and which ones to assign to subcontractors, under uncertainty of late requests which are gradually revealed during the day of operation. We call this problem the Dynamic Day-ahead Paratransit Planning problem. The developed model is a nonstandard two-stage recourse model in which ideas from stochastic programming and online optimization are combined: in the first stage clustered requests are assigned to vehicles, and in the dynamic second-stage problem an event-driven approach is used to cluster the late requests once they are revealed and subsequently assign them to vehicles. A genetic algorithm is used to solve the model. Computational results are presented for randomly generated data sets. Furthermore, a comparison is made to a similar problem we studied earlier in which the simplifying but unrealistic assumption has been made that all late requests are revealed at the beginning of the day of operation.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://irs.ub.rug.nl/ppn/305430173
    Download Restriction: no

    Bibliographic Info

    Paper provided by University of Groningen, Research Institute SOM (Systems, Organisations and Management) in its series Research Report with number 07010.

    as in new window
    Length:
    Date of creation: 2007
    Date of revision:
    Handle: RePEc:dgr:rugsom:07010

    Contact details of provider:
    Postal: PO Box 800, 9700 AV Groningen
    Phone: +31 50 363 7185
    Fax: +31 50 363 3720
    Email:
    Web page: http://som.eldoc.ub.rug.nl/
    More information through EDIRC

    Related research

    Keywords:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:dgr:rugsom:07010. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joke Bulthuis).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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