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.044MaRDI QIDQ2514743zbMATH OpenOpenAlexFDO

Authors Liang Wen, Bülent Çatay, Richard 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

heuristictime-varyingcongestion chargeminimum cost path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• Minimum cost VRP with time-dependent speed data and congestion charge
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• Minimum cost paths over dynamic networks
• Approximation solutions for time-varying shortest path problem
• Cheapest paths in dynamic networks

Cites work

• scientific article; zbMATH DE number 1300391 (Why is no real title available?)
• scientific article; zbMATH DE number 1488066 (Why is no real title available?)
• A directed hypergraph model for random time dependent shortest paths
• A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
• Handbooks in operations Research \& management science: Transportation
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Least expected time paths in stochastic, time-varying transportation networks
• Least possible time paths in stochastic, time-varying networks.
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
• Shortest paths in a network with time-dependent flow speeds
• The shortest route through a network with time-dependent internodal transit times
• Vehicle dispatching with time-dependent travel times

Cited in

(10)

• 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
• A note on the minimum instantaneous cost path of the dynamic traffic assignment problem
• A system dynamics model for determining the traffic congestion charges and subsidies
• Vehicle routing to minimize time-dependent emissions in urban areas
• Minimum cost VRP with time-dependent speed data and congestion charge
• Minimizing the total travel time with limited unfairness in traffic networks
• Time-dependent routing problems: a review
• An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints

This page was built for publication: Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514743)