An Intermodal Time-Dependent Minimum Cost Path Algorithm

2007 ◽  
pp. 113-132 ◽  
Author(s):  
Elaine Chang ◽  
Evangelos Floros ◽  
Athanasios Ziliaskopoulos
Keyword(s):  
Minimum Cost ◽  
Time Dependent

scholarly journals Determining time-dependent minimum cost paths under several objectives

2019 ◽  
Vol 105 ◽  
pp. 102-117 ◽  
Author(s):  
Hamza Heni ◽  
Leandro C. Coelho ◽  
Jacques Renaud
Keyword(s):  
Minimum Cost ◽  
Time Dependent ◽  
Minimum Cost Paths ◽  
Cost Paths

Cost-Optimal Time-dEpendent Routing with Time and Speed Constraints in Directed Acyclic Road Networks

2016 ◽  
Vol 15 (06) ◽  
pp. 1413-1450
Author(s):  
Yaqiong Liu ◽  
Hock Soon Seah ◽  
Guochu Shou
Keyword(s):  
Travel Time ◽  
Nonlinear Optimization ◽  
Fuel Consumption ◽  
Real World ◽  
Computer Games ◽  
Road Networks ◽  
Minimum Cost ◽  
Time Dependent ◽  
Optimal Time ◽  
Step Algorithm

Travel costs on road networks always change over time which implies road networks are time dependent. Most studies on time-dependent road networks simply find the shortest path with the least travel time without considering waiting at some nodes, or fuel consumption and toll fee. In real-world applications or computer games, waiting may be allowed at some nodes but disallowed at other nodes; a user can traverse an edge at different speeds; monetary travel cost contains fuel cost and toll fees; and users usually prefer the minimum-cost route under time and speed constraints. Therefore, we study Cost-Optimal Time-dEpendent Routing (COTER) problem with time and speed constraints. We utilize two fuel consumption models and compute the minimum fuel consumption with given travel time for highway edges via nonlinear optimization. We allow the toll fee function to be an arbitrary single-valued time-dependent function. We define an Optimal Cost (OC) function for each candidate node [Formula: see text], and derive the recurrence relation formula between [Formula: see text]’s incoming neighbors’ OC-functions and [Formula: see text]’s OC-functions. To solve COTER, we propose a five-step algorithm, namely, ALG-COTER, which uses Fibonacci-heap optimized Dijkstra, topological sorting, dynamic programming, binary min-heap optimization, nonlinear optimization, and backtracking algorithms. Experimental results on three real-world road networks of different sizes demonstrate that our algorithm finds the optimal route efficiently and is scalable to different parameters.

scholarly journals Minimum cost VRP with time-dependent speed data and congestion charge

2015 ◽  
Vol 56 ◽  
pp. 41-50 ◽  
Author(s):  
Liang Wen ◽  
Richard Eglese
Keyword(s):  
Minimum Cost ◽  
Time Dependent ◽  
Congestion Charge

Maximum production — minimum cost via value analysis

1963 ◽  
Vol 42 (3) ◽  
pp. 147
Author(s):  
N. Taylor
Keyword(s):  
Minimum Cost ◽  
Value Analysis ◽  
Maximum Production
Sign in / Sign up

Export Citation Format

Share Document