First Competitive Ant Colony Scheme for the CARP - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

First Competitive Ant Colony Scheme for the CARP

Résumé

The CARP consists on determining a set of vehicle trips with minimum total cost. Each trip starts and ends at the depot, each required edge of the site graph is serviced by one single trip, and the total demand handled by any vehicle does not exceed the capacity Q. The most efficient metaheuristics published so far are a sophisticated taboo search method (CARPET) of Hertz et al. [1] and a hybrid genetic algorithm proposed by Lacomme et al. [2]. In the beginning, no collective memory is used and ants use only heuristic information. Pheromone deposition is proportional to the fitness that can be defined for minimization objectives as the inverse of the solution quality or solution cost. Local search can also be applied to increase the convergence rate. The process is iterated until a lower bound is reached or a maximal number of iterations is carried out.

Dates et versions

hal-00119858 , version 1 (12-12-2006)

Identifiants

Citer

Philippe Lacomme, Christian Prins, Alain Tanguy. First Competitive Ant Colony Scheme for the CARP. 4th Ant Colony Optimization and Swarm Intelligence International Workshop, ANTS 2004, Sep 2004, Brussels, Belgium. pp.426-427, ⟨10.1007/978-3-540-28646-2_48⟩. ⟨hal-00119858⟩
76 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More