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.044zbMATH Open1304.90047OpenAlexW1973619036MaRDI QIDQ2514743FDOQ2514743
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
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
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- Least possible time paths in stochastic, time-varying networks.
- Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks
- Least expected time paths in stochastic, time-varying transportation networks
- Handbooks in operations Research \& management science: Transportation
- The shortest route through a network with time-dependent internodal transit times
- A directed hypergraph model for random time dependent shortest paths
- Vehicle dispatching with time-dependent travel times
- A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
- Title not available (Why is that?)
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- Title not available (Why is that?)
- Shortest paths in a network with time-dependent flow speeds
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)
