Abstract The Vehicle Routing Problem (VRP) involves the routing of vehicles to service a set of customers given vehicles with limited capacity and travel time. The VRP plays a major role in service based industries for transportation of goods. The cost of transportation is dependent upon the minimization of the total distance traveled by the vehicles and the number of vehicles required to transport the goods. The VRP belongs to the class of NP-complete problems. This paper explains the classic heuristics used to solve the VRP and introduces two algorithms, GenSect and GenClust, that are extensions of the classic VRP heuristics based on Genetic Algorithms for solving VRP’s with complex constraints.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems

    Campbell, A. M. / Savelsbergh, M. | British Library Online Contents | 2004



    A genetic algorithm for vehicle routing problems with temporal synchronization constraints

    Hocke, Stephan / Gajewski, Christina / Kasper, Mathias | SLUB | 2017


    Comprehensive Autonomous Vehicle Optimal Routing With Dynamic Heuristics

    V, Ragav / M, Jesher Joshua / P, Syed Ibrahim S | ArXiv | 2024

    Free access

    Introduction to the special issue on advances in vehicle routing and logistics optimization: heuristics

    Guéret, Christelle / Lehuédé, Fabien / Mendoza, Jorge E. et al. | Online Contents | 2018