IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1987012.html
   My bibliography  Save this paper

Computers’ paths with penalties for early or late arrival time

Author

Listed:
  • de PALMA, A.
  • HANSEN, P.
  • LABBE, M.

Abstract

We formulate the choice of a best path for a commuter leaving his/her home at a given time and willing to arrive at his/her destination within a given time interval. The objective function integrates constant costs for use of arcs, travel times and schedule delay. The travel times along arcs, which depend on exogenous congestion, are represented by functions of the arrival time at the origin node of the arc. The schedule delay is taken into consideration by penalizing arrival time at the destination outside the desired time interval. The problem is shown to be NP-hard, polynomial subcases are determined and a pseudo-polynomial algorithm is provided for the general case.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • de PALMA, A. & HANSEN, P. & LABBE, M., 1987. "Computers’ paths with penalties for early or late arrival time," LIDAM Discussion Papers CORE 1987012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1987012
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Leilei Zhang & Tito Homem-de-Mello, 2017. "An Optimal Path Model for the Risk-Averse Traveler," Transportation Science, INFORMS, vol. 51(2), pages 518-535, May.
    2. Zannat, Khatun E. & Choudhury, Charisma F. & Hess, Stephane, 2024. "Modelling time-of-travel preferences capturing correlations between departure times and activity durations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 184(C).
    3. Leonid Engelson & Ida Kristoffersson & Mohammad Saifuzzaman & André de Palma & Kiarash Motamedi, 2013. "Comparison of two dynamic transportation models: The case of Stockholm congestion charging," Working Papers hal-00779285, HAL.
    4. Zhou, Yuyang & Wang, Peiyu & Zheng, Shuyan & Zhao, Minhe & Lam, William H.K. & Chen, Anthony & Sze, N.N. & Chen, Yanyan, 2024. "Modeling dynamic travel mode choices using cumulative prospect theory," Transportation Research Part A: Policy and Practice, Elsevier, vol. 179(C).
    5. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    6. Mohammad Saifuzzaman & Leonid Engelson & Ida Kristoffersson & André de Palma, 2016. "Stockholm congestion charging: an assessment with METROPOLIS and SILVESTER," Transportation Planning and Technology, Taylor & Francis Journals, vol. 39(7), pages 653-674, October.

    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:cor:louvco:1987012. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.