Optimal Planning Of Swapping/Charging Station Network With The Consideration Of Differentiated Customer Demand

With the favorable conditions of environmental consciousness growth and government support,the electric vehicles get good opportunities in the development of industry and environmental awareness.The development and practice of the electric vehicle industry conforms with the trend of the times,and also provides new choice for policy makers and enterprise managers to fulfill the strategy of sustainable development.So far,the study of the optimal management of electric vehicle mainly focuses on how to effectively make management decisions from the interests of operators.However,there is limited research to analyze the joint decisions of the heterogeneous perception of potencial customers and optimal planning of swapping/charging station network.The lack of electric vehicle swapping/charging stations and improper service strategy make most customers hesitant to venture out with,or even acquire an electric vehicle.On the other hand,logistics enterprises are eager to address the issue of carbon emissions by logistics process,and hope to exploit potentialities from user behavior,service mode and hardware technology.Therefore,it is worth to study how the customer perception and service mode impacts the optimal planning of swapping/charging station network,and electric vehicle routing strategy.Based on previous studies and extensive field research,this paper aims to explore the battery charging/swapping station location problem with the impact of users' differentiated range anxiety and distance convenience,and the integrated sustainable planning of self-pickup and door-to-door delivery service with multi-type stations.Specifically,the innovative research includes:(1)This study analyzes the swapping/charging station network construction and service strategy selection when customers have heterogeneous perception of electric vehicles.This paper reveals important relationship between station network design and customers satisfaction.Motivated by EV service infrastructure network design under the battery leasing/electric car sharing service business models,this study presents an electric vehicle battery service network design problem considering a customers satisfaction related to “range anxiety” and “loss anxiety”.The problem is formulated as a linear integer programming model under deterministic and fuzzy scenarios.A Tabu Search heuristic combined with GRASP is proposed to efficiently solve the problem.Finally,we conduct parametric analysis on real-world road networks: the highway network in the City Cluster in the Middle Reaches of the Yangtze River in China.(2)This study takes into account customers' range anxiety and distance deviation when solving the BCSLP.This problem can be represented as a leader--follower game,where the station location planner is the leader and drivers,who choose their paths according to their range anxiety,are followers.The upper--level problem is to determine a strategy for the location of BCSs that minimizes the sum of the location cost and the deviation cost in order to satisfy a planned proportion of users.The lower-level problem is EV users' path-choice behavior.Based on the upper-level location strategy and the flow decaying function with range anxiety,the objective function maximizes the flow of EVs in such a way as to obtain a battery charging service for each origindestination(O--D)pair.That is,the users on each O--D pair would like to choose the path that minimizes their range anxiety.Then,the problem is solved using an adaptive large-neighborhood search,combined with a k-shortest path algorithm and an iterative greedy heuristic.Finally,the effects of parameters are analyzed in the context of a real-world road network.(3)We analyze the integrated sustainable planning of self-pickup and door-to-door delivery service strategy with multi-type stations and heterogeneous vehicles.This paper assumes the demand of each customer could be satisfied either directly(by being visited on the route)or indirectly(by being covered by the route on the condition that the distance between customer and at least one service station is shorter than the covered distance).The multi-type stations are used to offer charging services to visiting vehicles or free storage to customers.The problem is formulated as two integer programming models using a hybrid and separated route strategy,with the aim of improving the service efficiency and decreasing operational costs.A two-phase tabu search-modified Clarke-Wright saving algorithm(MCWSA-TS)is proposed to solve the problem.Compared with the MIP solution of CPLEX over these instances,MCWSA-TS searches the solution space and produces good solutions efficiently and effectively.Furthermore,we systematically conduct a parameter analysis on the service strategy,pick-up radius,vehicle types,and variable costs.