Results

Cellular Genetic Algorithms Results for Christofides, Mingozzi and Toth Instances

In the table below we show the results of solving 8 instances of the Christofides, Mingozzi and Toth benchmark with a canonical cGA (cGA), and three more cGAs with 2-Opt local search (cGA2o), 2-Opt and 1-Interchange (cGA2o1i), and 2-Opt and 2-Interchange (cGA2o2i).

Results of four cellular genetic algorithm variants on 8 Christofides, Mingozzi and Toth instances — Results of the canonical cGA and its hybrid variants with local search on 8 Christofides, Mingozzi and Toth instances.

In the next table we compare the best of the cGAs displayed above with some other well-known heuristics (RT = Tabu Search algorithm of Rochat and Taillard [RT95], AS = Ant System algorithm [BHS99], SA = SavingAnts algorithm [DGHRSS02], Prins = GA of Prins [Prin01], BB = Hybrid Genetic Algorithm of Berger and Barkaoui [BB03]):

Comparison of the best cellular genetic algorithm with RT, AS, SA, Prins and BB heuristics — Comparison of the best cGA with other well-known heuristics from the literature.

← Back to Christofides, Eilon and Toth results