This article presents a taxonomic review of the Vehicle Routing Problem (VRP) literature published between 2009 and 2013. The authors classify 144 articles using an adapted taxonomy based on Eksioglu et al. (2009), distinguishing five main topics: type of study, scenario characteristics, problem physical characteristics, information characteristics, and data characteristics. The classification aims to provide a structured overview of the VRP literature, enabling researchers to find relevant literature by selecting or eliminating specific characteristics. The results show that the Capacitated VRP (CVRP) remains the most common variant, while variants incorporating real-life constraints, such as the Open VRP, Dynamic VRP, and Time-dependent VRP, have gained increasing attention. Metaheuristics are the most frequently used solution methods, followed by exact methods and classical heuristics. The article also highlights the need for further development of general algorithms that can solve multiple VRP variants.This article presents a taxonomic review of the Vehicle Routing Problem (VRP) literature published between 2009 and 2013. The authors classify 144 articles using an adapted taxonomy based on Eksioglu et al. (2009), distinguishing five main topics: type of study, scenario characteristics, problem physical characteristics, information characteristics, and data characteristics. The classification aims to provide a structured overview of the VRP literature, enabling researchers to find relevant literature by selecting or eliminating specific characteristics. The results show that the Capacitated VRP (CVRP) remains the most common variant, while variants incorporating real-life constraints, such as the Open VRP, Dynamic VRP, and Time-dependent VRP, have gained increasing attention. Metaheuristics are the most frequently used solution methods, followed by exact methods and classical heuristics. The article also highlights the need for further development of general algorithms that can solve multiple VRP variants.