Abstract
This project investigates computational aspects in the practical application of vehicle routing problems (VRPs). The complexity of this class of problems hinders the attainment of optimal solutions in satisfactory computational time, making the application of exact algorithms challenging and necessitating the use of heuristic methods for their resolution. High-quality suboptimal solutions…