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

被引：119

作者：

Masmoudi, Mohamed Amine ^{[1
]}

Hosny, Manar ^{[2
]}

Demir, Emrah ^{[3
]}

Genikomsakis, Konstantinos N. ^{[4
]}

Cheikhrouhou, Naoufel ^{[1
]}

机构：

[1] Univ Appl Sci Western Switzerland HES SO, Geneva Sch Business Adm, CH-1227 Carouge, Switzerland

[2] King Saud Univ, CCIS, Comp Sci Dept, Riyadh, Saudi Arabia

[3] Cardiff Univ, Cardiff Business Sch, Panalpina Ctr Mfg & Logist Res, Cardiff CF10 3EU, S Glam, Wales

[4] Univ Mons, Res Inst Energy, NZED Unit, ERA Chair Net Zero Energy Efficiency City Dist, Rue Epargne 56, B-7000 Mons, Belgium

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2018年 / 118卷

关键词：

Electric vehicle; Dial-a-ride problem; Battery swapping; Evolutionary variable neighborhood search metaheuristic algorithm; VARIABLE NEIGHBORHOOD SEARCH; LOCATION-ROUTING PROBLEM; FROG-LEAPING ALGORITHM; ENERGY-CONSUMPTION; HEURISTIC APPROACH; SCHEDULING PROBLEM; CUT ALGORITHM; OPTIMIZATION; DELIVERY; PICKUP;

D O I：

10.1016/j.tre.2018.08.005

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for customers with special needs and/or disabilities. The DARP with Electric Vehicles and battery swapping stations (DARP-EV) concerns scheduling a fleet of EVs to serve a set of pre-specified transport requests during a certain planning horizon. In addition, EVs can be recharged by swapping their batteries with charged ones from any battery-swap stations. We propose three enhanced Evolutionary Variable Neighborhood Search (EVO-VNS) algorithms to solve the DARP-EV. Extensive computational experiments highlight the relevance of the problem and confirm the efficiency of the proposed EVO-VNS algorithms in producing high quality solutions.

引用

页码：392 / 420

页数：29

共 127 条

[1] The Vehicle Scheduling Problem for Fleets with Alternative-Fuel Vehicles [J].

Adler, Jonathan D. ;

Mirchandani, Pitu B. .

TRANSPORTATION SCIENCE, 2017, 51 (02) :441-456

[2] Online routing and battery reservations for electric vehicles with swappable batteries [J].

Adler, Jonathan D. ;

Mirchandani, Pitu B. .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 70 :285-302

[3] Routing aspects of electric vehicle drivers and their effects on network performance [J].

Agrawal, Shubham ;

Zheng, Hong ;

Peeta, Srinivas ;

Kumar, Amit .

TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2016, 46 :246-266

[4] Demand responsive transit systems with time-dependent demand: User equilibrium, system optimum, and management strategy [J].

Amirgholy, Mahyar ;

Gonzales, Eric J. .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2016, 92 :234-252

[5]

[Anonymous], MOSSIAM SERIES OPTIM

[6]

Bard JF, 1998, IIE TRANS, V30, P821, DOI 10.1023/A:1007500200749

[7] The Pollution-Routing Problem [J].

Bektas, Tolga ;

Laporte, Gilbert .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (08) :1232-1250

[8]

Bektas Tolga., 2016, Green Transportation Logistics, P243, DOI [DOI 10.1007/978-3-319-17175-3_7, 10.1007/978-3-319-17175-3_7]

[9] Hybrid metaheuristics in combinatorial optimization: A survey [J].

Blum, Christian ;

Puchinger, Jakob ;

Raidl, Guenther R. ;

Roli, Andrea .

APPLIED SOFT COMPUTING, 2011, 11 (06) :4135-4151

[10] An integrated optimization-simulation framework for vehicle and personnel relocations of electric carsharing systems with reservations [J].

Boyaci, Burak ;

Zografos, Konstantinos G. ;

Geroliminis, Nikolas .

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2017, 95 :214-237

← 1 2 3 4 5 6 7 8 9 10 →