An adaptive large neighborhood search approach for solving the electric vehicle routing problem

Keskin, Merve and Çatay, Bülent (2014) An adaptive large neighborhood search approach for solving the electric vehicle routing problem. In: 15th Workshop of the EURO Working Group: EU/ME: The Metaheuristic Community, Istanbul, Turkey

Full text not available from this repository. (Request a copy)

Abstract

The Electric Vehicle Routing Problem with Time Windows is a new variant of the classical Vehicle Routing Problem with Time Windows where the vehicles are routed to service a set of customers under recharging constraints. In this study, we propose an Adaptive Large Neighborhood Search method to solve this problem. Our initial results show the proposed method is effective in finding good solutions.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Vehicle routing, recharging, metaheuristics, large neighborhood search
Subjects: T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Industrial Engineering
Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Bülent Çatay
Date Deposited: 19 Jun 2014 10:45
Last Modified: 26 Apr 2022 09:15
URI: https://research.sabanciuniv.edu/id/eprint/24088

Actions (login required)

View Item
View Item