The electric vehicle routing problem with shared charging stations

Autor: Ola Jabali, Gilbert Laporte, Çağrı Koç, Jorge E. Mendoza
Přispěvatelé: Social Sciences University of Ankara, Politecnico di Milano [Milan] (POLIMI), HEC Montréal (HEC Montréal), ANR-15-CE22-0005,e-VRO,Optimisation des Tournées de Véhicules Electriques(2015), Mendoza, Jorge E., Optimisation des Tournées de Véhicules Electriques - - e-VRO2015 - ANR-15-CE22-0005 - AAPG2015 - VALID
Rok vydání: 2018
Předmět:
business.product_category
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]
Computer science
Strategy and Management
Strategy and Management1409 Tourism
0211 other engineering and technologies
ALNS
02 engineering and technology
Management Science and Operations Research
multidepot
Management of Technology and Innovation
0502 economics and business
Electric vehicle
Business and International Management
nonlinear charging function
electric vehicles
050210 logistics & transportation
021103 operations research
business.industry
Leisure and Hospitality Management
05 social sciences
Computer Science Applications1707 Computer Vision and Pattern Recognition
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Computer Science Applications
Routing (electronic design automation)
business
vehicle routing
Strategy and Management1409 Tourism
Leisure and Hospitality Management
Computer network
Zdroj: International Transactions in Operational Research
International Transactions in Operational Research, Wiley, 2018, 26 (4), pp.1211-1243
ISSN: 0969-6016
1475-3995
Popis: International audience; We introduce the electric vehicle routing problem with shared charging stations (E‐VRP‐SCS). The E‐VRP‐SCS extends the electric vehicle routing problem with nonlinear charging function (E‐VRP‐NL) by considering several companies that jointly invest in charging stations (CSs). The objective is to minimize the sum of the fixed opening cost of CSs and the drivers cost. The problem consists of deciding the location and technology of the CSs and building the routes for each company. It is solved by means of a multistart heuristic that performs an adaptive large neighborhood search coupled with the solution of mixed integer linear programs. It also contains a number of advanced efficient procedures tailored to handle specific components of the E‐VRP‐SCS. We perform extensive computational experiments on benchmark instances. We assess the competitiveness of the heuristic on the E‐VRP‐NL and derive 38 new best known solutions. New benchmark results on the E‐VRP‐SCS are presented, solved, and analyzed.
Databáze: OpenAIRE
Externí odkaz: