Optimum departure times for commuters in congested networks (Q2277160): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q180312
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Z. J. Liu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max heaps and generalized priority queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commuters' Paths with Penalties for Early or Late Arrival Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of univariate Lipschitz functions. I: Survey and properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the absolute extremum of a function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Method Seeking the Global Maximum of a Function / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02283700 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978586831 / rank
 
Normal rank

Latest revision as of 10:47, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimum departure times for commuters in congested networks
scientific article

    Statements

    Optimum departure times for commuters in congested networks (English)
    0 references
    0 references
    0 references
    1990
    0 references
    A mathematical model for a commuter to find his optimum departure time and path in a congested network is presented, in which the objective function is the sum of the fixed costs for use of arcs, cost functions of travel time depending on exogenous congestion and schedule delay. It can be shown that this problem is NP-hard. This paper presents an algorithm for solving the problem. The idea of the algorithm is based on the generalized shortest path algorithm given by the authors and \textit{M. Labbé} [Transp. Sci. 24, No.4, 276-286 (1990; Zbl 0724.90075)] and an algorithm of \textit{S. A. Piyavskij} [U.S.S.R. Comput. Math. Math. Phys. 12 (1972), No.4, 57-67 (1973); translation from Zh. Vychisl. Mat. Mat. Fiz. 12, 888-896 (1972; Zbl 0249.65046)] for the case of a one-sided Lipschitz function.
    0 references
    optimum departure time
    0 references
    congested network
    0 references
    NP-hard
    0 references
    generalized shortest path algorithm
    0 references
    one-sided Lipschitz function
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references