engleski

Exploring MAX-MIN Ant System Parameter Landscape for Symmetrical Traveling Salesman Problem

A relatively new class of heuristic algorithms called ant colony optimization (ACO) showed to be successful tool for (approximately) solving NP-hard problems. One of the most successful among ACO algorithms is a MAX-MIN ant system (MMAS). In this paper parameter landscape of the MMAS for symmetrical traveling salesman problem is explored, using different values for alpha, beta and rho parameters. This paper gave some general recommendation about parameters settings.

Ant Colony Optimization; ACO; Max-Min Ant System; MMAS; Traveling Salesman Problem; TSP; parameters; alpha; beta; rho; 2-Opt

nije evidentirano