Annals of Operations Research

, Volume 25, Issue 1, pp 279–290 | Cite as

Optimum departure times for commuters in congested networks

  • André de Palma
  • Pierre Hansen
Article

Abstract

We propose an algorithm to compute the optimum departure time and path for a commuter in a congested network. Constant costs for use of arcs, cost functions of travel time depending on exogenous congestion and schedule delay are taken into account. A best path for a given departure time is computed with a previous algorithm for the generalized shortest path problem. The globally optimal departure time and an optimal path are determined by adapting Piyavskii's algorithm to the case of one-sided Lipschitz functions.

Keywords

Cost Function Travel Time Short Path Departure Time Optimal Path 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. Arnott, A. de Palma and R. Lindsey, Economics of a Bottleneck, J. of Urban Econ. 27 (1990) 111–130.Google Scholar
  2. [2]
    M.D. Atkinson, J.-R. Sack, N. Santoro and Th. Strotholte. Min-max heaps and generalized priority queues, Commun. ACM 29 (1986) 996–1000.Google Scholar
  3. [3]
    A. de Palma, P. Hansen and M. Labbé, Commuters' paths with penalties for early or late arrival time, Transp. Sci. (1990) forthcoming.Google Scholar
  4. [4]
    P. Hansen, Bicriterion path problems, in:Multiple Criteria Decision-Making: Theory and Applications, G. Fandel and T. Gall (eds.) (Springer, Berlin, 1980) pp. 109–127.Google Scholar
  5. [5]
    P. Hansen, B. Jaumard and S.H. Lu, Global optimization of univariate Lipschitz functions. I. Survey and properties, RUTCOR Research Report 18-89 (1989), to appear in Math. Progr.Google Scholar
  6. [6]
    P. Hansen, B. Jaumard and S.H. Lu, Global optimization of univariate Lipschitz functions. II. New algorithms and computational comparison, RUTCOR Research Report 23-89 (1989), to appear in Math. Progr.Google Scholar
  7. [7]
    C. Hendrickson and G. Kocur, Schedule delay and departure time decisions in a deterministic model, Transp. Sci. 15 (1981) 62–77.Google Scholar
  8. [8]
    S.A. Piyavskii, An algorithm for finding the absolute minimum of a function, Theory of Optimal Solutions, No. 2, Kiev, IK AN USSR (in Russian) (1967) 13–24.Google Scholar
  9. [9]
    S.A. Piyavskii, An algorithm for finding the absolute extremum of a function, USSR Comput. Maths. Math. Phys. 12 (1972) 57–67; (Zh. vychisl. Mat. mat. Fiz. 12 (1972) 888–896).Google Scholar
  10. [10]
    B.O. Shubert, A sequential method seeking the global maximum of a function, SIAM J. Num. Anal. 9 (1972) 379–388.Google Scholar
  11. [11]
    W.S. Vickrey, Congestion theory and transport investment, Amer. Econ. Rev. 59 (1969) 251–261.Google Scholar

Copyright information

© J.C. Baltzer A.G. Scientific Publishing Company 1990

Authors and Affiliations

  • André de Palma
    • 1
  • Pierre Hansen
    • 2
    • 3
  1. 1.Department of Civil EngineeringNorthwestern UniversityEvanstonUSA
  2. 2.CERAD, Hautes Etudes CommercialesMontrealCanada
  3. 3.RUTCORRutgers UniversityNew BrunswickUSA

Personalised recommendations