Cooperative ant colony optimization for a hierarchical scheduling problem

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Dresvyanskiy, D., Semenkina, O., & Popov, E. A. (2020). Cooperative ant colony optimization for a hierarchical scheduling problem. In IOP Conference Series: Materials Science and Engineering (Vol. 734). Institute of Physics Publishing. https://doi.org/10.1088/1757-899X/734/1/012106

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free