Ant Algorithm for AP-N Aimed at Optimization of Complex Systems

Jerzy Mikulik, Mirosław Zajdel

Abstract


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.


Keywords


assignment problem; ant algorithm; optimization

Full Text:

PDF


DOI: https://doi.org/10.7494/dmms.2010.4.2.29

Refbacks

  • There are currently no refbacks.