| Summary: | 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. © 2025, Semarak Ilmu Publishing. All rights reserved.
|
|---|