NGAP: A novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning

Conference proceedings article

Authors/Editors

No matching items found.

Strategic Research Themes

Publication Details

Author list: Changaival, Boonyarit; Danoy, Grégoire; Kliazovich, Dzmitry; Guinand, Frédéric; Brust, Matthias R.;
Musial, Jedrzej; Lavangnananda, Kittichai; Bouvry, Pascal;

Publisher: Hindawi

Publication year: 2020

Start page: 259

End page: 260

Number of pages: 2

ISBN: 9781450371278

ISSN: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089752516&doi=10.1145%2f3377929.3389941&partnerID=40&md5=0625f4cda58037980d33cb0d40f1e64b

Languages: English-Great Britain (EN-GB)

View on publisher site

Abstract

The growing awareness of the environmental movement greatly influences the transportation scene of this century leading to several transportation alternatives. One among them is carsharing service which has been gaining traction and support in major cities around the globe. It is also undeniable that the location planning of the fleet vehicles can contribute to its success. The fleet vehicles must be easily accessed and in the proximity of various transportation hubs and facilities. In this paper, we study the Vehicle Placement Problem (VPP) for round-trip carsharing and propose a novel hybrid algorithm, NGAP, which is a combination of NSGA-III and Pareto Local Search (PLS) to enhance the quality of the results over NSGA-III. The proposed algorithm is tested on 10 synthetic and four real-world instances. NGAP is shown to be significantly more efficient than NSGA-III on almost all instances in terms of Inverted Generational Distance (IGD), and Hypervolume. © 2020 Owner/Author.

Keywords

Carsharing, Hybridization, Multi-Objective Optimization, Vehicle Placement