Abstract

Aiming to provide an approach for finding energy-efficient routes in dynamic and stochastic transportation networks for electric vehicles, this paper addresses the route planning problem in dynamic transportation network where the link travel times are assumed to be random variables to minimize total energy consumption and travel time. The changeable signals are introduced to establish state-space-time network to describe the realistic dynamic traffic network and also used to adjust the travel time according to the signal information (signal cycle, green time, and red time). By adjusting the travel time, the electric vehicle can achieve a nonstop driving mode during the traveling. Further, the nonstop driving mode could avoid frequent acceleration and deceleration at the signal intersections so as to reduce the energy consumption. Therefore, the dynamically adjusted travel time can save the energy and eliminate the waiting time. A multiobjective 0-1 integer programming model is formulated to find the optimal routes. Two methods are presented to transform the multiobjective optimization problem into a single objective problem. To verify the validity of the model, a specific simulation is conducted on a test network. The results indicate that the shortest travel time and the energy consumption of the planning route can be significantly reduced, demonstrating the effectiveness of the proposed approaches.

Highlights

  • With the problem of global energy shortage and environment pollution becoming more and more serious, it has gradually become the common choice of the world to improve the traditional high energy consumption and high-polluted development mode

  • The intersection signal is an important part to reflect the dynamic of network, which has a periodical variation [9]

  • Shao et al [15] proposed an electric vehicle routing problem with charging time and variable travel time using dynamic Dijkstra algorithm to find the shortest path between any two adjacent nodes along the routes

Read more

Summary

Introduction

With the problem of global energy shortage and environment pollution becoming more and more serious, it has gradually become the common choice of the world to improve the traditional high energy consumption and high-polluted development mode. We shall consider the intersection signals into the route planning problem and propose a nonstop dynamic route planning method to achieve the travel route with the shortest time and the lowest energy consumption. Chang et al [10] proposed a Journal of Advanced Transportation vehicular-ad-hoc-network-based A∗ route planning algorithm to calculate the route with the shortest traveling time or the lowest energy consumption. Shao et al [15] proposed an electric vehicle routing problem with charging time and variable travel time using dynamic Dijkstra algorithm to find the shortest path between any two adjacent nodes along the routes.

Problem Statement
Model Formulation
Examples and Results
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call