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 120
- Downloads 0
Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs
We consider mixed-integer linear programming (MIP) models of production planning problems known as the small bucket lot-sizing and scheduling problems. We present an application of a class of valid inequalities to the ca...
Interval methods for computing strong Nash equilibria of continuous games
The problem of seeking strong Nash equilibria of a continuous game is considered. For some games these points cannot be found analytically, only numerically. Interval methods provide us an approach to rigorously verify t...
CP-driven Production Process Planning in Multiproject Environment
The way enterprise capabilities are used decides about its competitiveness among other ones. In that context modeling aimed at production tasks allocation planning plays a crucial role especially at concurrently executed...
Mixed Integer Programming Approaches to Planning and Scheduling in Electronics Supply Chains
This paper discusses mixed integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and d...
Coordinating Contracts in SCM: A Review of Methods and Literature
Supply chain coordination through contracts has been a burgeoning area of re- search in recent years. In spite of rapid development of research, there are only a few structured analyses of assumptions, methods, and appli...