2024/01/18 by Doerner, Karl, Gronalt, Manfred, Hartl, Richard F. +3
paper · doi:10.57938/c0a0ac66-7218-46c2-bf1e-25057138d533
In this paper we propose a hybrid approach for solving vehicle routing problems. The main idea is to combine an Ant System (AS) with a problem specific constructive heuristic, namely the well known Savings algorithm. This differs from previous approaches, where the subordinate heuristic was the Nearest Neighbor algorithm initially proposed for the TSP. We compare our approach with some other classic, powerful meta-heuristics and show that our results are competitive.