A mathematical model for the electric vehicle routing with time windows considering queuing system at charging stations and alternative paths

Authors

  • Asal Karimpour Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran
  • Mostafa Setak Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran
Abstract:

Due to many damages that human activities have imposed on the environment, authorities, manufacturers, and industry owners have taken into account the development of supply chain more than ever. One of the most influential and essential human activities in the supply chain are transportation which green vehicles such as electric vehicles (EVs) are expected to generate higher economic and environmental impact. To this end, designing efficient routing scheme for the fleet of EVs is significant. A remarkable issue about EVs is their need to stations for charging their battery. Due to the existence of time limitations, more attention should be paid to time spent at the charging station, so considering the queuing system at charging stations makes more precise time calculations.  Furthermore, multi-graphs are more consistent with the characteristics of the transportation network. Hence, we consider alternative paths including two criterion cost and energy consumption in the network. First, we develop a mixed integer linear programming for the electric vehicle routing problem on a multi-graph with the queue in charging stations to minimize the traveling and charging costs. Since the proposed problem is NP-hard in a strong sense, we provide a simulated annealing algorithm to search the solution space efficiently and explore a large neighborhood within short computational time.  The efficiency of the model is investigated with numerical and illustrative examples. Then the sensitivity analysis is performed on the proposed model to indicate the importance of the queuing system and the impact of battery capacity on the penetration of EVs.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A goal programming model for vehicle routing problem with backhauls and soft time windows

The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

full text

THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

full text

A mathematical model for vehicle routing and scheduling problem with cross-docking by considering risk

Today, many companies after achieving improvements in manufacturing operations are focused on the improvement of distribution systems and have long been a strong tendency to optimize the distribution network in order to reduce logistics costs that the debate has become challenging. Improve the flow of materials, an activity considered essential to increase customer satisfaction. In this study, ...

full text

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order...

full text

The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations

Driven by new laws and regulations concerning the emission of greenhouse gases, carriers are starting to use battery electric vehicles (BEVs) for last-mile deliveries. The limited battery capacities of BEVs necessitate visits to recharging stations during delivery tours of industry-typical length, which have to be considered in the route planning in order to avoid inefficient vehicle routes wit...

full text

Appendix of: The Electric Vehicle Routing Problem with Time Windows and Recharging Stations

We compiled an improved version of the G-VRP model of Erdogan and Miller-Hooks (2012) and used it to solve the set of small G-VRP benchmark instances with CPLEX. To be concise, we use the original notation from Erdogan and Miller-Hooks (2012) to describe our model:

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 12  issue 1

pages  0- 0

publication date 2019-01-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023