xii High Performance Programming for Soft Computing
13.2 Proposed Method 285
13.2.1 Methodology 286
13.3 Experiments 287
13.4 Simulation Results 287
13.4.1 Berlin 52 cities 288
13.4.2 Bier 127 (127 cities) 288
13.5 Conclusions 289
References 290
14. Variants of Ant Colony Optimization: A Metaheuristic for 291
Solving the Traveling Salesman Problem
14.1 Introduction 291
14.2 ACO Variants 292
14.2.1 Traveling Salesman Problem (TSP) 292
14.2.2 Elitist Ant System 293
14.2.3 Rank based ant system 293
14.2.4 Max-Min ant system 293
14.2.5 Ant Colony System (ACS) 293
14.3 Graphical Interface in Matlab 294
14.4 Sequential Processing 295
14.5 Parallel Processing 296
14.6 Simulation Results 297
14.6.1 Speedup ...