Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

DOI10.1016/j.ejor.2013.10.044zbMath1304.90047MaRDI QIDQ2514743

Bülent Çatay, Liang Wen, Richard W. Eglese

Publication date: 3 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.10.044

zbMATH Keywords

heuristic; time-varying; congestion charge; minimum cost path

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

Related Items

Vehicle routing to minimize time-dependent emissions in urban areas, Minimum cost VRP with time-dependent speed data and congestion charge, Time-dependent routing problems: a review, A system dynamics model for determining the traffic congestion charges and subsidies, Determining time-dependent minimum cost paths under several objectives, Optimizing the composite cost involved in road motor-transporting trucks by taking into account traffic condition, The role of operational research in green freight transportation, An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints

Cites Work

• Least possible time paths in stochastic, time-varying networks.
• A directed hypergraph model for random time dependent shortest paths
• Vehicle dispatching with time-dependent travel times
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Shortest paths in a network with time-dependent flow speeds
• A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
• The shortest route through a network with time-dependent internodal transit times
• Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Unnamed Item
• Unnamed Item
• Unnamed Item