TY - UNPB
T1 - SavingsAnts for the vehicle routing problem
AU - Doerner, Karl
AU - Gronalt, Manfred
AU - Hartl, Richard F.
AU - Reimann, Marc
AU - Strauß, Christine
AU - Stummer, Michael
PY - 2001
Y1 - 2001
N2 - 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.
AB - 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.
U2 - 10.57938/c0a0ac66-7218-46c2-bf1e-25057138d533
DO - 10.57938/c0a0ac66-7218-46c2-bf1e-25057138d533
M3 - WU Working Paper and Case
T3 - Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
BT - SavingsAnts for the vehicle routing problem
CY - Vienna
ER -