First Competitive Ant Colony Scheme for the CARP

摘要: 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 site graph is serviced by one single trip, demand handled any does not exceed capacity Q. most efficient metaheuristics published so far are sophisticated taboo search method (CARPET) Hertz et al. [1] hybrid genetic algorithm proposed Lacomme [2]. In beginning, no collective memory used ants use only heuristic information. Pheromone deposition proportional to fitness that can be defined for minimization objectives as inverse solution quality or Local also applied increase convergence rate. process iterated until lower bound reached maximal number iterations carried out.