Commuters' Paths with Penalties for Early or Late Arrival Time

André de Palma (), Pierre Hansen and Martine Labbé
Additional contact information
Pierre Hansen: RUTCOR Rutgers University, New Brunswick, New Jersey
Martine Labbé: Erasmus University Rotterdam, 3000 DR Rotterdam, the Netherlands

Transportation Science, 1990, vol. 24, issue 4, 276-286

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.

Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.24.4.276 (application/pdf)

Related works:
Working Paper: Computers’ paths with penalties for early or late arrival time (1987)
Working Paper: Commuters' Paths With Penalties for Early or Late Arrival Time (1987)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:24:y:1990:i:4:p:276-286

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().