Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge (Q2514743): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4248930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest route through a network with time-dependent internodal transit times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3523238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle dispatching with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least possible time paths in stochastic, time-varying networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and efficiency of Moore-algorithms for the shortest route problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A directed hypergraph model for random time dependent shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in a network with time-dependent flow speeds / rank
 
Normal rank

Latest revision as of 16:09, 9 July 2024

scientific article
Language Label Description Also known as
English
Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge
scientific article

    Statements

    Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge (English)
    0 references
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    heuristic
    0 references
    minimum cost path
    0 references
    time-varying
    0 references
    congestion charge
    0 references

    Identifiers

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