The article presents a detailed classification of 144 vehicle routing problem (VRP) articles published between 2009 and 2013, based on an adapted taxonomy from Eksioglu et al. (2009). The classification aims to provide a structured overview of VRP literature, enabling researchers to identify relevant studies by selecting or excluding specific characteristics. The study highlights the growing complexity of VRP models, which now incorporate real-life factors such as time-dependent travel times, time windows, and dynamic demand. The VRP remains a central topic in operations research, with a rapidly growing body of literature. The classification reveals that the Capacitated VRP (CVRP) is the most common variant, followed by the VRP with time windows (VRPTW). Other notable variants include the Open VRP (OVRP), Dynamic VRP (DVRP), and Time-Dependent VRP (TDVRP). These variants reflect the increasing focus on real-world applications and the need for more flexible and adaptive solution methods. The study also discusses the use of heuristics and metaheuristics, which are more suitable for large-scale practical problems than exact methods. The classification table allows researchers to analyze trends and identify promising areas for future research. The results indicate that OVRP, DVRP, and TDVRP have gained increasing attention in recent years. The study concludes that while the VRP literature is extensive, many proposed solution methods are problem-specific and not easily applicable to other variants. The development of general algorithms that can handle multiple VRP variants is seen as a promising direction for future research.The article presents a detailed classification of 144 vehicle routing problem (VRP) articles published between 2009 and 2013, based on an adapted taxonomy from Eksioglu et al. (2009). The classification aims to provide a structured overview of VRP literature, enabling researchers to identify relevant studies by selecting or excluding specific characteristics. The study highlights the growing complexity of VRP models, which now incorporate real-life factors such as time-dependent travel times, time windows, and dynamic demand. The VRP remains a central topic in operations research, with a rapidly growing body of literature. The classification reveals that the Capacitated VRP (CVRP) is the most common variant, followed by the VRP with time windows (VRPTW). Other notable variants include the Open VRP (OVRP), Dynamic VRP (DVRP), and Time-Dependent VRP (TDVRP). These variants reflect the increasing focus on real-world applications and the need for more flexible and adaptive solution methods. The study also discusses the use of heuristics and metaheuristics, which are more suitable for large-scale practical problems than exact methods. The classification table allows researchers to analyze trends and identify promising areas for future research. The results indicate that OVRP, DVRP, and TDVRP have gained increasing attention in recent years. The study concludes that while the VRP literature is extensive, many proposed solution methods are problem-specific and not easily applicable to other variants. The development of general algorithms that can handle multiple VRP variants is seen as a promising direction for future research.