Pickup and delivery with electric vehicles under stochastic battery depletion

https://doi.org/10.1016/j.cie.2020.106512Get rights and content

Highlights

  • A pickup and delivery problem with electric vehicles under stochastic battery depletion is addressed.

  • A chance-constrained mixed integer non-linear programming model is presented.

  • A linear approximation for energy requirement estimation is proposed.

  • Respecting stochastic battery depletion alleviates the range anxiety of drivers.

  • The added value of the study is shown by means of several numerical experiments.

Abstract

The use of electric vehicles in passenger and freight transportation has been increasing especially in developed countries. Stochastic battery depletion is one of the concerns that needs to be addressed in electric vehicle routing. This paper accordingly proposes a chance-constrained mixed integer non-linear programming model and a linear approximation for the pickup and delivery problem with electric vehicles under stochastic battery depletion assumption. The ability to respect stochastic battery depletion could also help to alleviate the range anxiety of drivers. We have showed the added value of respecting stochasticity in battery depletion and applicability of the proposed approximation by means of several numerical experiments.

Introduction

Prominent goals stated in the 2011 European White Paper to achieve a competitive and resource efficient transport system are to “halve the use of ‘conventionally-fuelled’ cars in urban transport by 2030; phase them out in cities by 2050; achieve essentially CO2-free city logistics in major urban centres by 2030.” (EU White Paper, 2011). The term ‘conventionally-fuelled’ refers to vehicles that use non-hybrid, internal combustion engines. One of the alternative transportation options to conventional ones is Battery-Electric Freight Vehicles (BEV). They are currently regarded as a viable solution to achieve a sustainable logistic system (Savelsbergh & Van Woensel, 2016).

BEV offer several benefits in urban applications. The main benefits that could be attained by the use of BEV for transportation can be summarized as follows: (i) reduction or elimination of tailpipe emissions contributing to air quality, (ii) ensuring relatively higher energy efficiency especially in lower speeds, and (iii) reduction of road traffic noise nuisance by the help of quieter engines for drivers and people in residential areas (Afroditi et al., 2014, Pelletier et al., 2016).

At the moment the current practice is to use conventional gasoline and diesel vehicles for the vast majority of freight deliveries in urban environments.1 However, fleet proportion of electric vehicles for both passenger and freight transportation especially in the developed countries continually increases by means of academic research, technological developments, aggressive boost of authorities and applied projects in real life distribution networks. For instance, a research conducted in Urban System Laboratory at Imperial College London demonstrates that switching ten percent of London’s current truck and van fleets from diesel to electrical by 2021 could enable to save the capital close to £1 billion and contribute to the correction of London’s air pollution problems.2 One of the projects on the topic named FREVUE3 funded by the European Union’s Seventh Framework Programme provided evidence on how the use of BEV can contribute to emission free city logistics and how these vehicles can be used as a viable alternative for conventional ones.

For urban applications, one of the main weaknesses in BEV is range anxiety, which is a feeling that your electric vehicle cannot complete your planned trip (Jing, Yan, Kim, & Sarvi, 2016). That anxiety may arise due to various reasons such as optimistic vehicle range limit indication or uncertain traffic conditions. Improving the accuracy of range-prediction technology is listed as one of the main strategies used to alleviate range anxiety among BEV users (Eisel et al., 2016, Guo et al., 2018). Road and traffic conditions are the prominent factors that affect the rate of battery depletion. Accordingly, for decision makers in logistics management, it is key to plan the most efficient drive route that takes road and traffic conditions into account, which are often uncertain in real life urban problems.

In operational-level urban logistics management, thousands of companies and organizations engaged in delivery and/or collection of goods (or people) are confronted with the vehicle routing problem (VRP) every day (Toth and Vigo, 2014, Braekers et al., 2016). The classical VRP deals with a problem of finding the least cost tours for visiting a number of scattered customers. Our focus here is on a variant of the VRP called one-to-one pickup and delivery problem (PDP) that aims to satisfy paired pickup and delivery requests, i.e., each of the pickup request is associated with a single delivery destination (Cordeau et al., 2008, Şahin et al., 2013). Fig. 1 presents a generic representation of the one-to-one PDP with electric vehicles containing a depot, two battery swap stations, three vehicles (routes) and 14 requests. For each request i,i+ on the upper part of each node refers a pickup point and i- refers the corresponding delivery point. Values on the lower part of each node show the remaining battery level of vehicles.

As distinct from the vast of the literature, in line with recent developments in the field we address the one-to-one PDP when BEV are used for delivery operations. Such an attempt requires to consider the following specific features of the problem. First, the maximum range of electric vehicles might restrict to complete some delivery tours and the used batteries might have to be replaced with fully charged ones in the battery swap locations (Yang and Sun, 2015, Koç and Karaoglan, 2016). Second, energy consumption of vehicles along the route might be subject to uncertainty, especially in urban distribution that escalates range anxiety of drivers (Liu, Wang, Yamamoto, & Morikawa, 2018), and several potential costs including vehicle rescue service and penalty costs of not being able to complete delivery plans on-time. To the best of our knowledge, the aforementioned issues have not been tackled in the literature before.

From this point of view, this paper aims to provide a model for the pickup and delivery problem with electric vehicles and stochastic battery depletion. The use of the model could ensure to have applicable delivery plans for logistics decision makers. Note that the provided plans could be regarded as worthwhile in terms of triple bottom line of sustainable development: economic (logistics costs), environmental (energy usage) and social (range anxiety of drivers). The ability to respect stochastic battery depletion could help to alleviate the range anxiety of drivers. Here, exact energy consumption amounts between location pairs are not known in advance. For each arc and vehicle, the uncertain energy consumption is represented by a normally distributed random variable with a certain mean and standard deviation. The uncertainty is thereby quantified.

The rest of the paper is structured as follows. Section 2 presents a brief literature review on the topic to demonstrate the contribution to the field. Section 3 presents a formal description of the studied problem. Section 4 presents the proposed decision support model. Section 5 provides computational analyses. The last section presents conclusions and future research directions.

Section snippets

Related literature review

The PDPs are confronted in several practical applications such as delivery operations of third party logistics firms (e.g., Şahin et al., 2013), maritime cargo operations (e.g., Andersson, Christiansen, & Fagerholt, 2011), door-to-door transportation of people (called as also Dial-a-Ride Problem in the literature, e.g., Marković, Nair, Schonfeld, Miller-Hooks, & Mohebbi, 2015). An interested reader to the applications of PDPs can be referred to the surveys on the topic conducted by Berbeglia et

Problem description

The problem here is defined on a directed graph G={V,A}, where V is the vertex set and A is the arc set. The vertex set consists of {P,D,S,{0}}, where P={1,,n} is a set of pickup vertices, D={n+1,,2n} is a set of corresponding delivery vertices, S={2n+1,,2n+|S|} is a set of battery swap locations for the electric vehicles and {0} refers to the depot that serves as the start and end points for electric vehicles. The set of vehicles is denoted by K={1,,|K|}, and Qk refers the load capacity of

Formulation of the one-to-one pickup and delivery problem with electric vehicles

This section presents a chance-constrained mixed integer non-linear programming formulation with a linear approximation for the defined problem. The required notation for the model is presented in Table 2.

The formulation starts with the following objective function.Minimise(i,j)AkKtTcE[ei,j,k]Xi,j,k,tThe objective function (1) comprises cost of expected energy consumed due to delivery operations.iPStTX0,i,k,t=iDStTXi,0,k,t=1,kKjV:(i,j)AkKtTXi,j,k,t=1,iPjV:(i,j)AtT

Numerical experimentation

This section provides numerical analyses to demonstrate the applicability of the proposed model in practice and the potential benefits that could be obtained from its use. The ILOG-OPL development studio and CPLEX 12.6 optimization package have been utilized to develop and solve the formulation for the experiments. The analyses are performed on a computer of Pentium(R) i7 2.4 GHz CPU with 8 GB memory. The data used through this section are summarized in Table A.1.

The remainder of the section is

Conclusion

This paper proposes a chance-constrained mixed integer non-linear programming model and a linear approximation for the pickup and delivery problem with electric vehicles under stochastic battery depletion assumption. To the best of our knowledge, this is the first attempt to address this problem.

We have showed the added value of the proposed model based on several numerical experiments. According to the results, the delivery plans obtained when uncertainty is ignored may have a higher

CRediT authorship contribution statement

Mehmet Soysal: Conceptualization, Methodology, Validation, Writing - original draft, Writing - review & editing, Supervision, Project administration. Mustafa Çimen: Methodology, Validation, Writing - review & editing. Sedat Belbağ: Software, Investigation, Resources, Visualization, Writing - review & editing.

References (73)

  • D. Goeke

    Granular tabu search for the pickup and delivery problem with time windows and electric vehicles

    European Journal of Operational Research

    (2019)
  • D. Goeke et al.

    Routing a mixed fleet of electric and conventional vehicles

    European Journal of Operational Research

    (2015)
  • F. Guo et al.

    The battery charging station location problem: Impact of users’ range anxiety and distance convenience

    Transportation Research Part E: Logistics and Transportation Review

    (2018)
  • G. Hiermann et al.

    Routing a mix of conventional, plug-in hybrid, and electric vehicles

    European Journal of Operational Research

    (2019)
  • G. Hiermann et al.

    The electric fleet size and mix vehicle routing problem with time windows and recharging stations

    European Journal of Operational Research

    (2016)
  • J. Hof et al.

    Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops

    Transportation Research Part B: Methodological

    (2017)
  • W. Jie et al.

    The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology

    European Journal of Operational Research

    (2019)
  • M. Keskin et al.

    Partial recharge strategies for the electric vehicle routing problem with time windows

    Transportation Research Part C: Emerging Technologies

    (2016)
  • M. Keskin et al.

    A matheuristic method for the electric vehicle routing problem with time windows and fast chargers

    Computers & Operations Research

    (2018)
  • M. Keskin et al.

    Electric vehicle routing problem with time-dependent waiting times at recharging stations

    Computers & Operations Research

    (2019)
  • Ç. Koç et al.

    The green vehicle routing problem: A heuristic based exact solution approach

    Applied Soft Computing

    (2016)
  • Y. Li et al.

    Public recharging infrastructure location strategy for promoting electric vehicles: A bi-level programming approach

    Journal of Cleaner Production

    (2018)
  • K. Liu et al.

    Exploring the interactive effects of ambient temperature and vehicle auxiliary loads on electric vehicle energy consumption

    Applied Energy

    (2018)
  • N. Marković et al.

    Optimizing dial-a-ride services in Maryland: Benefits of computerized routing and scheduling

    Transportation Research Part C: Emerging Technologies

    (2015)
  • M.A. Masmoudi et al.

    The dial-a-ride problem with electric vehicles and battery swapping stations

    Transportation Research Part E: Logistics and Transportation Review

    (2018)
  • S.M. Mirhedayatian et al.

    A framework to evaluate policy options for supporting electric vehicles in urban freight transport

    Transportation Research Part D: Transport And Environment

    (2018)
  • A. Montoya et al.

    The electric vehicle routing problem with nonlinear charging function

    Transportation Research Part B: Methodological

    (2017)
  • K. Murakami

    A new model and approach to electric and diesel-powered vehicle routing

    Transportation Research Part E: Logistics And Transportation Review

    (2017)
  • S. Pan et al.

    A crowdsourcing solution to collect e-commerce reverse flows in metropolitan areas

    IFAC-PapersOnLine

    (2015)
  • V. Pimenta et al.

    Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles

    European Journal of Operational Research

    (2017)
  • M. Şahin et al.

    An efficient heuristic for the multi-vehicle one-to-one pickup and delivery problem with split loads

    Transportation Research Part C: Emerging Technologies

    (2013)
  • L. Shen et al.

    An energy-efficient reliable path finding algorithm for stochastic road networks with electric vehicles

    Transportation Research Part C: Emerging Technologies

    (2019)
  • M. Soysal et al.

    A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem

    Computers & Operations Research

    (2017)
  • M. Soysal et al.

    On the mathematical modeling of green one-to-one pickup and delivery problem with road segmentation

    Journal of Cleaner Production

    (2018)
  • H. Wang et al.

    Operations of a taxi fleet for advance reservations using electric vehicles and charging stations. Transportation Research Record: Journal of the

    Transportation Research Board

    (2013)
  • Y. Xiao et al.

    Development of energy consumption optimization model for the electric vehicle routing problem with time windows

    Journal of Cleaner Production

    (2019)
  • Cited by (26)

    • Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands

      2023, Computers and Operations Research
      Citation Excerpt :

      Studying the PDPTW with BEVs under the partial recharging strategy, Goeke (2019) developed a granular tabu search with a policy to determine the amount of energy recharged to solve the problem. Soysal et al. (2020) studied the PDP with BEVs and stochastic battery depletion, and devised a linear approximation for the developed chance-constrained mixed integer non-linear programming model. In sum, no model in the extant literature covers all the aspects of our problem, especially modeling the demand uncertainty in the framework of robust optimization, and none of the existing algorithms can fully deal with our problem.

    View all citing articles on Scopus
    View full text