Open AccessCooperative ant colony optimization for a hierarchical scheduling problem
Author(s) -
Denis Dresvyanskiy,
О. Э. Семенкина,
E. O. Popov
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/734/1/012106
Subject(s) - travelling salesman problem , ant colony optimization algorithms , computer science , scheduling (production processes) , mathematical optimization , job shop scheduling , artificial intelligence , mathematics , schedule , operating system
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.