Decision-Making Support in Vehicle Routing Problems: A Review of Recent Literature

Syazwani Zainal Abidin; Nor Izzati Zainal Abidin; Hanita Daud

doi:10.37934/araset.44.2.124134

Authors

Syazwani Zainal Abidin Mathematical Sciences Studies, College of Camputing, Informatics and Media, Universiti Teknologi MARA(UiTM) Cawangan Pahang, Kampus Raub, 27600 Raub, Pahang, Malaysia
Nor Izzati Zainal Abidin Centre for Mathematical Sciences, Universiti Malaysia Pahang Al-Sultan Abdullah, Lebuh Persiaran Tun Khalil Yaakob, 26300 Kuantan, Pahang, Malaysia
Hanita Daud Department of Fundamental and Applied Sciences, Faculty of Science and Information Technology, Universiti Teknologi PETRONAS, 32610 Bandar Seri Iskandar, Perak, Malaysia

DOI:

https://doi.org/10.37934/araset.44.2.124134

Keywords:

Vehicle routing problem, Multi-Criteria Decision-Making, Trade-off ranking

Abstract

The Vehicle Routing Problem (VRP) involves a set of customers with known locations, each having a certain demand for goods or services. There is also a fleet of vehicles available, each with limited capacity and often a fixed starting point. With the aid of mathematical programming tools, this paper offers an overview of the most recent VRP research. This study also examines the algorithms for solving VRP models and categorizes them in terms of their application areas. For these reasons, related publications that appeared in the international journal have been compiled and studied. According to the literature review, multi-criteria decision-making (MCDM) techniques have yet to constitute the most mathematical programming methods used to solve the VRP problem.