An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem

M. Wen, E. Linde, S. Ropke, Pitu Mirchandani, A. Larsen

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

This paper addresses the Electric Vehicle Scheduling Problem (E-VSP), in which a set of timetabled bus trips, each starting from and ending at specific locations and at specific times, should be carried out by a set of electric buses or vehicles based at a number of depots with limited driving ranges. The electric vehicles are allowed to be recharged fully or partially at any of the given recharging stations. The objective is to firstly minimize the number of vehicles needed to cover all the timetabled trips, and secondly to minimize the total traveling distance, which is equivalent to minimizing the total deadheading distance. A mixed integer programming formulation as well as an Adaptive Large Neighborhood Search (ALNS) heuristic for the E-VSP are presented. ALNS is tested on newly generated E-VSP benchmark instances. Result shows that the proposed heuristic can provide good solutions to large E-VSP instances and optimal or near-optimal solutions to small E-VSP instances.

Original languageEnglish (US)
Pages (from-to)73-83
Number of pages11
JournalComputers and Operations Research
Volume76
DOIs
StatePublished - Dec 1 2016

Fingerprint

Vehicle Scheduling
Neighborhood Search
Electric Vehicle
Electric vehicles
Scheduling Problem
Scheduling
Heuristics
Minimise
Mixed Integer Programming
Integer programming
Vehicle scheduling
Electric vehicle
Heuristic search
Optimal Solution
Cover
Benchmark
Formulation
Range of data

Keywords

  • Electric vehicles
  • Large neighborhood search
  • Partial charging
  • Vehicle scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research
  • Modeling and Simulation

Cite this

An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem. / Wen, M.; Linde, E.; Ropke, S.; Mirchandani, Pitu; Larsen, A.

In: Computers and Operations Research, Vol. 76, 01.12.2016, p. 73-83.

Research output: Contribution to journalArticle

@article{4f55806b5a714c31958908cfb7ad111f,
title = "An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem",
abstract = "This paper addresses the Electric Vehicle Scheduling Problem (E-VSP), in which a set of timetabled bus trips, each starting from and ending at specific locations and at specific times, should be carried out by a set of electric buses or vehicles based at a number of depots with limited driving ranges. The electric vehicles are allowed to be recharged fully or partially at any of the given recharging stations. The objective is to firstly minimize the number of vehicles needed to cover all the timetabled trips, and secondly to minimize the total traveling distance, which is equivalent to minimizing the total deadheading distance. A mixed integer programming formulation as well as an Adaptive Large Neighborhood Search (ALNS) heuristic for the E-VSP are presented. ALNS is tested on newly generated E-VSP benchmark instances. Result shows that the proposed heuristic can provide good solutions to large E-VSP instances and optimal or near-optimal solutions to small E-VSP instances.",
keywords = "Electric vehicles, Large neighborhood search, Partial charging, Vehicle scheduling",
author = "M. Wen and E. Linde and S. Ropke and Pitu Mirchandani and A. Larsen",
year = "2016",
month = "12",
day = "1",
doi = "10.1016/j.cor.2016.06.013",
language = "English (US)",
volume = "76",
pages = "73--83",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem

AU - Wen, M.

AU - Linde, E.

AU - Ropke, S.

AU - Mirchandani, Pitu

AU - Larsen, A.

PY - 2016/12/1

Y1 - 2016/12/1

N2 - This paper addresses the Electric Vehicle Scheduling Problem (E-VSP), in which a set of timetabled bus trips, each starting from and ending at specific locations and at specific times, should be carried out by a set of electric buses or vehicles based at a number of depots with limited driving ranges. The electric vehicles are allowed to be recharged fully or partially at any of the given recharging stations. The objective is to firstly minimize the number of vehicles needed to cover all the timetabled trips, and secondly to minimize the total traveling distance, which is equivalent to minimizing the total deadheading distance. A mixed integer programming formulation as well as an Adaptive Large Neighborhood Search (ALNS) heuristic for the E-VSP are presented. ALNS is tested on newly generated E-VSP benchmark instances. Result shows that the proposed heuristic can provide good solutions to large E-VSP instances and optimal or near-optimal solutions to small E-VSP instances.

AB - This paper addresses the Electric Vehicle Scheduling Problem (E-VSP), in which a set of timetabled bus trips, each starting from and ending at specific locations and at specific times, should be carried out by a set of electric buses or vehicles based at a number of depots with limited driving ranges. The electric vehicles are allowed to be recharged fully or partially at any of the given recharging stations. The objective is to firstly minimize the number of vehicles needed to cover all the timetabled trips, and secondly to minimize the total traveling distance, which is equivalent to minimizing the total deadheading distance. A mixed integer programming formulation as well as an Adaptive Large Neighborhood Search (ALNS) heuristic for the E-VSP are presented. ALNS is tested on newly generated E-VSP benchmark instances. Result shows that the proposed heuristic can provide good solutions to large E-VSP instances and optimal or near-optimal solutions to small E-VSP instances.

KW - Electric vehicles

KW - Large neighborhood search

KW - Partial charging

KW - Vehicle scheduling

UR - http://www.scopus.com/inward/record.url?scp=84977665966&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84977665966&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2016.06.013

DO - 10.1016/j.cor.2016.06.013

M3 - Article

VL - 76

SP - 73

EP - 83

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -