Ant algorithm for AP-N aimed at optimization of complex systems

• Autorzy: Mikulik J. , Zajdel M.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

assignment problem; ant algorithm; optimization

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Decision Making in Manufacturing and Services
• Rocznik: 2010
• Tom: Vol. 4, no. 1-2
• Strony: 29--36
• Opis fizyczny: Bibliogr. [13] poz., rys., wykr.

Twórcy

autor

Mikulik J.

• Department of Management and Systems Engineering, Faculty of Management, AGH University of Science and Technology

autor

Zajdel M.

• Department of Management and Systems Engineering, Faculty of Management, AGH University of Science and Technology

Bibliografia

• Aiex, R. M., Resende, M. G. C., Pardalos, P. M. and Toraldo, G., 2005. Grasp with path relinking for the three-index assignment problem. INFORMS Journal on Computing, 17(2), 224–247.
• Balas, E. and Saltzman, M. J., 1991. An algorithm for the three-index assignment problem. Operations Research, 39(1), 150–161.
• Burkard, R. E., Rudolf, R. and Woeginger, G. J., 1996. Three dimensional axial assignment problems with decomposable cost coefficients. Discrete Applied Mathematics, 65(1-3), 123–139.
• Crama, Y. and Spieksma, F. C. R., 1992. Approximation algorithms for three-dimensional assignment problems with triangle inequalities. European Journal of Operational Research, 60(3), 273–279.
• Escamilla-Ambrosio, P. J. and Lieven, N., 2004. A multiple-sensor multiple-target tracking approach for the autotaxi system. IEEE Intelligent Vehicles Symposium, Parma, June 14–17, pp. 601–606.
• Filipowicz, B., 1998. Mathematical modelling of decision issues – part I [in Polish]. AGH University of Science and Technology Press, Krakow.
• Górecki, H., 2006. Optimization and control of dynamic systems [in Polish]. AGH University of Science and Technology Press, Krakow.
• Huang, G. and Lim, A., 2006. A hybrid genetic algorithm for the three-index assignment problem. European Journal of Operational Research, 172(1), 249–257.
• Karp, R.M., 1972. Reducibility among combinatorial problems. [in:] Miller, R. E., Thatcher, J. W. (Eds): Complexity of Computer Computations, Plenum Press, pp. 85–103.
• Kuhn, H.W., 1955. The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2, pp. 83–97.
• Merkle, D. and Middendorf, M., 2005. Swarm intelligence. [in:] Burke, E., Kendall, G. (Eds), Introductory Tutorials in Optimization, Search and Decision Support Techniques Methodology, Springer, pp. 401–435.
• Owsinski, J. W. and Straszak, A., 2002. Information Society, operational research and management [in Polish]. EXIT Publishing House, Warszawa.
• Zajdel, M. and Filipowicz, B., 2008. Multidimensional assignment problem as a tool for decision processes’ support in company [in Polish]. Models of computer science engineering. Selected applications [in Polish], Volume 3, pp. 288–293.