Generalized vehicle routing problem: A survey of solution methods and variants
Abstract
Generalized Vehicle Routing Problem(GVRP) is a NP-hard combinatorial problem. It consists of finding a set of routes for a number of vehicles with limited capacity on a graph with the vertices partitioned into clusters with given demands such that exactly one vertex from each cluster is visited. Since there is no survey on this problem, this paper can review all variants studied and the solution method used to solve it. This article provides an up-to-date overview of the research papers addressed on this difficult problem.
How to Cite This Article
Honoré Randriamaromisy, Harrimann Ramanantsoa, André Totohasina (2022). Generalized vehicle routing problem: A survey of solution methods and variants . International Journal of Multidisciplinary Research and Growth Evaluation (IJMRGE), 3(3), 440-450.