Evolving Dispatching Rules for Dynamic Vehicle Routing with Genetic Programming

• Published in: Algorithms Vol. 16; no. 6; p. 285
• Main Authors: Jakobović, Domagoj, Đurasević, Marko, Brkić, Karla, Fosin, Juraj, Carić, Tonči, Davidović, Davor
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.06.2023
• Subjects: Algorithms; Automation; Cloud computing; Decomposition; Dispatching rules; dynamic scheduling; Genetic algorithms; genetic programming; Heuristic; hyper-heuristics; Methods; Resource management; time windows; Vehicle routing; vehicle routing problem; Vehicles; Germany; Croatia
• ISSN: 1999-4893; 1999-4893
• DOI: 10.3390/a16060285

Many real-world applications of the vehicle routing problem (VRP) are arising today, which range from physical resource planning to virtual resource management in the cloud computing domain. A common trait of these applications is usually the large scale size of problem instances, which require fast algorithms to generate solutions of acceptable quality. The basis for many VRP approaches is a heuristic which builds a candidate solution that may subsequently be improved by a local search procedure. Since there are many variants of the basic VRP model, specialised algorithms must be devised that take into account specific constraints and user-defined objective measures. Another factor is that the scheduling process may be carried out in dynamic conditions, where future information may be uncertain or unavailable or may be subject to change. When all of this is considered, there is a need for customised heuristics, devised for a specific problem variant, that could be used in highly dynamic environments. In this paper, we use genetic programming (GP) to evolve a suitable dispatching rule to build solutions for different objectives and classes of VRP problems, applicable in both dynamic and stochastic conditions. The results show great potential, since this method may be used for different problem classes and user-defined performance objectives.