2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS) 2015
DOI: 10.1109/mtits.2015.7223239
|View full text |Cite
|
Sign up to set email alerts
|

Energy-efficient routing strategies based on real-time data of a local traffic management center

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 3 publications
0
3
0
Order By: Relevance
“…To decrease computational times associated with shortest path algorithms that can handle negative link costs such as Floyd-Warshall, the authors propose the shifting technique described by Johnson in [34]. An energy-efficient routing model for EVs based on real-time data of a local traffic center has been presented in [35]. The authors proposed an altered Bellman-Ford algorithm that can deal with time-variant, negative links and dimensionless nodes are expanded to areas of intersections to be able to implement the dynamic traffic data.…”
Section: B Energy-efficient Routingmentioning
confidence: 99%
“…To decrease computational times associated with shortest path algorithms that can handle negative link costs such as Floyd-Warshall, the authors propose the shifting technique described by Johnson in [34]. An energy-efficient routing model for EVs based on real-time data of a local traffic center has been presented in [35]. The authors proposed an altered Bellman-Ford algorithm that can deal with time-variant, negative links and dimensionless nodes are expanded to areas of intersections to be able to implement the dynamic traffic data.…”
Section: B Energy-efficient Routingmentioning
confidence: 99%
“…The work in [39] employs Dijkstra's algorithm to calculate fuel-efficient paths in terms of the physical length and the estimated fuel consumption on each road segment which is estimated from the average travelling speed. Similarly, an energy-efficient routing algorithm for electric cars is presented in [32], where a cost function is defined for each edge in the network in terms of road slope, vehicle speed, vehicle acceleration, journey time and road surface conditions; since edge weights may evaluate negative values which cannot be handled by Dijkstra's or A* algorithms, the Bellman-Ford-algorithm is employed to compute the most energy-efficient paths. A fuel-efficient driving strategy for high-way vehicles is proposed in [29], using the Max-Min Ant system [36] to optimize the vehicle speed and acceleration commands.…”
Section: Energy-efficient Traffic Managementmentioning
confidence: 99%
“…Investigations on such models have been conducted considering various factors. Most approaches take inputs as road gradient and route length [6][7][8][9][10][11][12] in energy estimation, and other factors like vehicle specifications and driving behavior are also considered [6,10,11]. With input factors determined, a model can be established via recording all the considered factors in a testing driving trip, followed by training and generating the model parameters based on the recorded data [12,13].…”
Section: Introductionmentioning
confidence: 99%