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
- EP ID EP165189
- DOI 10.7494/dmms.2010.4.2.29
- Views 116
- Downloads 0
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments
In the paper we consider the problem of scheduling of unit-length jobs on 3 or 4 uniform parallel machines to minimize schedule length or total completion time. We assume that jobs are subject to some kind of mutual excl...
Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
Decision making with multiple criteria requires preferences elicited from the decision maker to determine a solution set. Models of preferences, that follow upon the concept of nondominated solutions introduced by Yu (19...
On Efficient Coloring of Chordless Graphs
We are given a simple graph G = (V, E). Any edge e ∈ E is a chord in a path P ⊆ G (cycle C ⊆ G) iff a graph obtained by joining e to path P (cycle C) has exactly two vertices of degree 3. A class of graphs without any ch...
Modelling Set-up Times Overlapping Two Periods in the Proportional Lot-Sizing Problem with Identical Parallel Machines
This paper presents a new mixed integer programming model for the Proportional Lot-Sizing Problem (PLSP) with identical parallel machines and set-up times overlappingtwo periods. The proposed model assumes constant perio...
An Attribute Based Similarity Function for VRP Decision Support
When solving problems in the real world using optimization tools, the model solved by the tools is often only an approximation of the underlying, real, problem. In these circumstances, a decision maker (DM) should consid...