Kussmann, SimonGodat, YannickHanne, ThomasDornberger, Rolf2024-04-082024-04-082020978-1-4503-7677-8https://doi.org/10.1145/3383845.3383880https://irf.fhnw.ch/handle/11654/42828The Capacitated Vehicle Routing Problem (CVRP), an extension of the Traveling Salesman Problem with two added constraints, a local depot and a capacity constraint for each vehicle, is solved by a Hybrid Bat Algorithm (HBA). This paper investigates how the standard Bat Algorithm must be extended to become a HBA being able to solve the CVRP. The Hybrid Bat Algorithm is tested and compared to three other optimization algorithms for the CVRP, the Clarke & Wright Savings Algorithm, the Holmes and Parker Algorithm, and the Fisher and Jaikumar Method. It is discussed how the HBA is able to deliver decent solutions of the CVRP.en330 - Wirtschaft04B - Beitrag Konferenzschrift107–111