Battery swap station location-routing problem with capacitated electric vehicles. Yang, J. & Sun, H. Computers & Operations Research, 55:217-232, Elsevier Ltd, 3, 2015.
Battery swap station location-routing problem with capacitated electric vehicles [link]Website  abstract   bibtex   
In this paper, we present an electric vehicles battery swap stations location routing problem (BSS-EV-LRP), which aims to determine the location strategy of battery swap stations (BSSs) and the routing plan of a fleet of electric vehicles (EVs) simultaneously under battery driving range limitation. The problem is formulated as an integer programming model under the basic and extended scenarios. A four-phase heuristic called SIGALNS and a two-phase Tabu Search-modified Clarke and Wright Savings heuristic (TS-MCWS) are proposed to solve the problem. In the proposed SIGALNS, the BSSs location stage and the vehicle routing stage are alternated iteratively, which considers the information from the routing plan while improving the location strategy. In the first phase, an initial routing plan is generated with a modified sweep algorithm, leading to the BSSs location subproblem, which is then solved by using an iterated greedy heuristic. In the third phase, the vehicle routes resulting from the location subproblem are determined by applying an adaptive large neighborhood search heuristic with several new neighborhood structures. At the end of SIGALNS, the solution is further improved by a split procedure. Compared with the MIP solver of CPLEX and TS-MCWS over three sets of instances, SIGALNS searches the solution space more efficiently, thus producing good solutions without excessive computation on the medium and large instances. Furthermore, we systematically conduct economic and environmental analysis including the comparison between basic and extended scenarios, sensitivity analysis on battery driving range and efficiency analysis about the vehicle emissions reduction when EVs are used in the logistics practice.
@article{
 title = {Battery swap station location-routing problem with capacitated electric vehicles},
 type = {article},
 year = {2015},
 identifiers = {[object Object]},
 keywords = {Adaptive large neighborhood search,Battery swapping,Electric vehicles,Location-routing problem},
 pages = {217-232},
 volume = {55},
 websites = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84918803272&partnerID=tZOtx3y1},
 month = {3},
 publisher = {Elsevier Ltd},
 id = {38dccfb9-40a7-336b-ada3-98fcb0ad11b6},
 created = {2015-01-13T16:35:41.000Z},
 accessed = {2014-12-23},
 file_attached = {false},
 profile_id = {9696f304-db07-31d9-a8cd-d208939f9889},
 group_id = {062cfb24-9ce4-3a92-a41f-541a783d7b95},
 last_modified = {2017-03-09T15:29:23.010Z},
 read = {false},
 starred = {true},
 authored = {false},
 confirmed = {true},
 hidden = {false},
 citation_key = {Yang2015},
 private_publication = {false},
 abstract = {In this paper, we present an electric vehicles battery swap stations location routing problem (BSS-EV-LRP), which aims to determine the location strategy of battery swap stations (BSSs) and the routing plan of a fleet of electric vehicles (EVs) simultaneously under battery driving range limitation. The problem is formulated as an integer programming model under the basic and extended scenarios. A four-phase heuristic called SIGALNS and a two-phase Tabu Search-modified Clarke and Wright Savings heuristic (TS-MCWS) are proposed to solve the problem. In the proposed SIGALNS, the BSSs location stage and the vehicle routing stage are alternated iteratively, which considers the information from the routing plan while improving the location strategy. In the first phase, an initial routing plan is generated with a modified sweep algorithm, leading to the BSSs location subproblem, which is then solved by using an iterated greedy heuristic. In the third phase, the vehicle routes resulting from the location subproblem are determined by applying an adaptive large neighborhood search heuristic with several new neighborhood structures. At the end of SIGALNS, the solution is further improved by a split procedure. Compared with the MIP solver of CPLEX and TS-MCWS over three sets of instances, SIGALNS searches the solution space more efficiently, thus producing good solutions without excessive computation on the medium and large instances. Furthermore, we systematically conduct economic and environmental analysis including the comparison between basic and extended scenarios, sensitivity analysis on battery driving range and efficiency analysis about the vehicle emissions reduction when EVs are used in the logistics practice.},
 bibtype = {article},
 author = {Yang, Jun and Sun, Hao},
 journal = {Computers & Operations Research}
}

Downloads: 0