Composite Goal Methods for Transportation Network Optimization

The simulation results show that the ant colony algorithm can effectively obtain the global optimal solution and realize the shortest task completion time.. Keywords:

In this paper, we proposed a parallel algorithm based upon ant colony optimization for solving the maximum weight clique problem.. The proposed approach was designed using

This work is devoted to development of swarm intelligence for competitive facility location problem with elastic demand in the fol- lowing formulation.. In a competitive

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

This paper presents a hybridization of the Ant Colony Algorithm and a Complete Local search with Memory heuristic, in order to maximize as much as possible; the free time

This algorithm uses a specific chaotic dynamic obtained from the R¨ ossler system [4] in order to optimise the coverage of an unknown area by a swarm of UAVs.. The R¨ ossler system

MMAS has been improved with the integration of a local search. The 2-opt operator has been applied to the best ant before the pheromone update [13]. This method has also improved

The elitism-based immigrants ACO (EIACO) algorithm uses an immigrants scheme where ants are generated by mutating the best ant of the previous iter- ation. These immigrants also