Generalized vehicle routing problem: Contemporary trends and research directions

Abstract

Generalized Vehicle Routing Problem (GVRP) is a challenging operational research problem which has been widely studied for nearly two decades. In this problem, it is assumed that graph nodes are grouped into a number of clusters, and serving any node of a cluster eliminates the need to visit the other nodes of that cluster. The general objective of this problem is to find the set of nodes to visit and determine the service sequence to minimize the total traveling cost. In addition to these general conditions, GVRP can be formulated with different assumptions and constraints to practically create different sub-types and variants. This paper aims to provide a comprehensive survey of the GVRP literature and explore its various dimensions. It first encompasses the definition of GVRP, similar problems, mathematical models, classification of different variants and solution methods developed for GVRPs, and practical implications. Finally, some useful suggestions are discussed to extend the problem. For this review study, Google Scholar, Scopus, Science Direct, Emerald, Springer, and Elsevier databases were searched for keywords, and 160 potential articles were extracted, and eventually, 45 articles were judged to be relevant.

Keywords

• Generalized vehicle routing problem
• Traveling salesman problem
• Roaming delivery location
• Solution method
• Mathematical model