Time filter

Source Type

Hulianytskyi L.,Vm Glushkov Institute Of Cybernetics Nas Ukraine | Sirenko S.,Vm Glushkov Institute Of Cybernetics Nas Ukraine
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

The paper presents a hybrid metaheuristic method ACO-H [4] for combinatorial optimization problems that combines two population-based approaches - ant colony optimization (ACO) and H-method. ACO is a multi-agent metaheuristic that has been successfully applied to many difficult optimization problems [1]. H-method is an extension of the discrete downhill simplex method [6] that applies during the search process specially defined segments. Similar to H-method ideas were introduced in the context of tabu search and now are known as path relinking [2]. © 2010 Springer-Verlag Berlin Heidelberg. Source

Discover hidden collaborations