Authors: Matijević, Luka 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Metaheuristic Approaches for the Green Vehicle Routing Problem
Journal: YUJOR - The Yugoslav Journal of Operations Research
Issue Date: 2022
Rank: M24
ISSN: 0354-0243
DOI: 10.2298/YJOR211120016M
The green vehicle routing problem (GVRP) is a relatively new topic, which aims to minimize greenhouse gasses (GHG) emissions produced by a fleet of vehicles. Both internal combustion vehicles (ICV) and alternative fuel vehicles (AFV) are considered, dividing GVRP into two separate subclasses: ICV-based GVRP and AFV-based GVRP. In the ICV-based subclass, the environmental aspect comes from the objective function which aims to minimize GHG emissions or fuel usage of ICVs. On the other hand, the environmental aspect of AFV-based GVRP is implicit and comes from using AFVs in transport. Since GVRP is NP-hard, finding the exact solution in a reasonable amount of time is often impossible for larger instances, which is why metaheuristic approaches are predominantly used. The purpose of this study is to detect gaps in the literature and present suggestions for future research in the field. For that purpose, we review recent papers in which GVRP was tackled by some metaheuristic methods and describe algorithm specifics, VRP attributes, and objectives used in them.
Keywords: Pollution routing problem | minimization of greenhouse gasses emission | alternative fuel vehicles | recharging stations | sustainability
Publisher: Faculty of Organizational Sciences, Belgrade
Project: Advanced artificial intelligence techniques for analysis and design of system components based on trustworthy BlockChain technology - AI4TrustBC 
Serbian Ministry of Education, Science and Technological Development, Agreement No. 451-03-9/2021-14/200029

Show full item record


checked on May 21, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




This item is licensed under a Creative Commons License Creative Commons