Ant Metaheuristic with Adapted Personalities for the Vehicle Routing Problem

At each generation of an ant algorithm, each ant builds a solution step by step by adding an element to it. Each choice is based on the greedy force (short term profit or heuristic information) and the trail system (central memory which collects information during the search process). Usually, all the ants of the population have the same characteristics and behaviors. In contrast in this paper, a new type of ant metaheuristic is proposed. It relies on the use of ants with different personalities. Such a method has been adapted to the well-known vehicle routing problem, and even if it does not match the best known results, its performance is encouraging (on one benchmark instance, new best results have however been found), which opens the door to a new ant algorithm paradigm.


Editor(s):
Corman, F
Voss, S
Negenborn, Rr
Published in:
Computational Logistics (Iccl 2015), 9335, 3-15
Presented at:
6th International Conference on Computational Logistics (ICCL), Delft, NETHERLANDS, SEP 23-25, 2015
Year:
2015
Publisher:
Cham, Springer Int Publishing Ag
ISSN:
0302-9743
ISBN:
978-3-319-24264-4
978-3-319-24263-7
Keywords:
Laboratories:




 Record created 2016-02-16, last modified 2018-04-29


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)