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

Journal Title: Decision Making in Manufacturing and Services - Year 2010, Vol 4, Issue 1

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.

Authors and Affiliations

Jerzy Mikulik, Mirosław Zajdel

Keywords

Related Articles

Scheduling Jobs with Linear Model of Simultaneous Ageing and Learning Effects

In the paper, we introduce some new scheduling model in which learning and aging effects are both considered simultaneously. In this model the actual processing time of the jobs depends only on its position in a schedule...

Maximization of an Asymmetric Utility Function by the Least Squares

This note points out that a utility maximization procedure proposed in an earlier paper may be reduced to the least squares.The utility function is asymmetric in the sense that for each cue an ideal value and a permissib...

Application of Fuzzy Based VIKOR Approach for Multi-Attribute Group Decision Making (MAGDM): A Case Study in Supplier Selection

In today’s competitive global markets, selection of a potential supplier plays an important role to cut production costs as well as material costs of the company. This leads to successful survival and sustainability in a...

Models, methods and information technologies of protection of corporate systems of transport based on intellectual identification of threats

In article results of researches on development of methods and models of intellectual recognition of threats to information systems of transport. The article to contain results of the researches, allowing to raise level...

A Bi-Objective Portfolio Optimization with Conditional Value-at-Risk

This paper presents a bi-objective portfolio model with the expected return as a performance measure and the expected worst-case return as a risk measure. The problems are formulated as a bi-objective linear program. Num...

Download PDF file
  • EP ID EP165189
  • DOI 10.7494/dmms.2010.4.2.29
  • Views 132
  • Downloads 0

How To Cite

Jerzy Mikulik, Mirosław Zajdel (2010). Ant Algorithm for AP-N Aimed at Optimization of Complex Systems. Decision Making in Manufacturing and Services, 4(1), 29-36. https://www.europub.co.uk/articles/-A-165189