Neutrosophic Genetic Algorithm for solving the Vehicle Routing Problem with uncertain travel times


  • Rafael Rojas Gualdron Department of Industrial Engineering, Universidad de Investigación y Desarrollo, Barrancabermeja, Colombia
  • Florentin Smarandache Mathematics Department, University of New Mexico, 705 Gurley Ave., Gallup, NM 87301, USA


Vehicle Routing Problem (VRP), Neutrosophic Theory, Uncertain Travel Times, Stochastic Vehicle Routing Problem (SVRP), Genetic Algorithm


The Vehicle Routing Problem (VRP) has been extensively studied by different researchers from all over the world in recent years. Multiple solutions have been proposed for different variations of the problem, such as Capacitive Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRP-TW), Vehicle Routing Problem with Pickup and Delivery (VRPPD), among others, all of them with deterministic times. In the last years, researchers have been interested in including in their different models the variations that travel times may experience when exposed to all kind of phenomena, mainly vehicle traffic. This article addresses the VRP from this perspective, proposing the design and implementation of a genetic algorithm based on neutrosophic theory for calculating the fitness function of each route, considering the variability and uncertainty present in travel times. A deterministic genetic algorithm is also implemented with the average travel times to compare it with the neutrosophic algorithm using simulation. As conclusion, a deterministic algorithm does not necessarily generate the best solution in the real world, full of uncertainty. Also, the quantification of uncertainty using neutrosophic theory can be used in route planning, opening a broad and interesting field of research for future investigations.


Download data is not yet available.




How to Cite

Gualdron , R. R., & Smarandache , F. . (2022). Neutrosophic Genetic Algorithm for solving the Vehicle Routing Problem with uncertain travel times. Neutrosophic Sets and Systems, 52, 400-409. Retrieved from

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>