Abstract
An important part of modern integrated decision support systems in any area is scheduling. At the same time, domain knowledge can be extremely complex and includes numerous restrictions and process rules, which makes the corresponding optimization problem highly complicated. This paper is based on a hierarchical problem structure where the top-level problem is the travelling salesman problem, and the nested resource-constrained project scheduling problem is replaced by the simulation model. Cooperative ant colony optimization as well as other biology-inspired algorithms were evaluated on a set of generated problems, and the obtained experimental results are presented here.
Export citation and abstract BibTeX RIS
Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.