Ant Algorithm for AP-N Aimed at Optimization of Complex Systems
2010 ◽
Vol 4
(2)
◽
pp. 29-36
Keyword(s):
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
Keyword(s):
2020 ◽
Vol 39
(3)
◽
pp. 654-669
◽
2012 ◽
Vol 35
(4)
◽
pp. 98-109
2009 ◽
Vol 21
(3)
◽
pp. 468-479
◽
Keyword(s):
2021 ◽
Vol 10
(1)
◽
pp. 659-673