Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem (CROSBI ID 182391)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Martinović, Goran ; Bajer, Dražen Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem // Advances in Electrical and Computer Engineering, 12 (2012), 1; 25-32. doi: 10.4316/AECE.2012.01005

Podaci o odgovornosti

Martinović, Goran ; Bajer, Dražen

engleski

Elitist Ant System with 2-opt Local Search for the Traveling Salesman Problem

The Traveling Salesman Problem is one of the most famous problems in combinatorial optimization. The paper presents an algorithm based upon the elitist ant system for solving the traveling salesman problem. 2-opt local search is incorporated in the elitist ant system, and it is used for improvement of a given number of solutions previously constructed by artificial ants. A simple mechanism for avoiding a too early stagnation of the search is also proposed. The aforementioned is based on depositing strong pheromones on solution edges of randomly selected ants called random elitist ants. The aim is to encourage exploration in a greater area of the solution space. Experimental analysis shows how high-quality solutions can be achieved by using the considered algorithm instead of the usual elitist ant system with incorporated 2-opt local search.

2-opt algorithm; elitist ant system; local search; search stagnation; Traveling Salesman Problem

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

12 (1)

2012.

25-32

objavljeno

1582-7445

10.4316/AECE.2012.01005

Povezanost rada

Računarstvo

Poveznice
Indeksiranost