Optimum departure times for commuters in congested networks
Annals of Operations ResearchPublished 1 December 1990
André de Palma, Pierre Hansen
Citations6
SJR quartileQ1
SJR score1.09
SNIP1.62
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
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
Social SciencesEngineering
American Economic ReviewCONGESTION THEORY AND TRANSPORT INVESTMENT
1,946 Citations1994William Vickrey
Journal of Urban EconomicsEconomics of a bottleneck
659 Citations1990Richard Arnott, André de Palma +1 more
Lecture notes in economics and mathematical systemsBicriterion Path Problems
504 Citations1980Pierre Hansen
Algorithms are provided for some of the bicriterion path problems in directed graphs, including polynomial algorithms for the MAXMIN-MAXMIN problem and the MINSUM-MAX MIN problem, and a pseudo-polynomial exact algorithm as well as a fullyPolynomial approximation scheme for the MINsUM-MINSUM problem.
SIAM Journal on Numerical AnalysisA Sequential Method Seeking the Global Maximum of a Function
407 Citations1972Bruno O. Shubert
A sequential search method for finding the global maximum of an objective function of a single variable defined on a closed interval and such that some bound on its rate of change is available is proposed.
USSR Computational Mathematics and Mathematical PhysicsAn algorithm for finding the absolute extremum of a function
314 Citations1972S.A. Piyavskii
Transportation ScienceSchedule Delay and Departure Time Decisions in a Deterministic Model
308 Citations1981Chris Hendrickson, George Kocur
Communications of the ACMMin-max heaps and generalized priority queues
170 Citations1986M. D. Atkinson, Jörg-Rüdiger Sack +2 more
The proposed structure, called a min-max heap, can be built in linear time and can be generalized to support other similar order-statistics operations efficiently (e.g., constant time and logarithmic time).
Mathematical ProgrammingGlobal optimization of univariate Lipschitz functions: I. Survey and properties
80 Citations1992Pierre Hansen, Brigitte Jaumard +1 more
The problems of using an approximation for the Lipschitz constant are addressed, reducing as much as possible the expected length of the region of indeterminacy which contains all globally optimal points and avoiding remaining subintervals without points with a globallyε-optimal value.
Transportation ScienceCommuters' Paths with Penalties for Early or Late Arrival Time
39 Citations1990André de Palma, Pierre Hansen +1 more
The problem is shown to be NP-hard, polynomial subcases are determined and a pseudo-polynomial algorithm is provided for the general case.
Global Optimization of Univariate Lipschitz Functions: II. New Algorithms and Computational Comparison
1 Citations1989Pierre Hansen, Brigitte Jaumard +1 more