Szczegóły publikacji
Opis bibliograficzny
Substitution tasks method for discrete optimization / Ewa DUDEK-DYDUCH, Lidia DUTKIEWICZ // W: Artificial Intelligence and Soft Computing : 12th International Conference, ICAISC 2013 : Zakopane, Poland, June 9–13, 2013 : proceedings, Pt. 2 / eds. Leszek Rutkowski [et al.]. — Berlin ; Heidelberg : Springer-Verlag, cop. 2013. — (Lecture Notes in Computer Science ; ISSN 0302-9743 ; 7895. Lecture Notes in Artificial Intelligence). — ISBN: 978-3-642-38609-1; e-ISBN: 978-3-642-38610-7. — S. 419–430. — Bibliogr. s. 429–430, Abstr.
Autorzy (2)
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 74473 |
|---|---|
| Data dodania do BaDAP | 2013-07-16 |
| DOI | 10.1007/978-3-642-38610-7_39 |
| Rok publikacji | 2013 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Konferencja | 12th International Conference on Artificial Intelligence and Soft Computing |
| Czasopismo/seria | Lecture Notes in Computer Science |
Abstract
The aim of the paper is to present a novel heuristic optimization method for discrete dynamic optimization problems. The method has been named substitution tasks method (ST method). According to the method, a solution is generated by means of sequence of dynamically created local optimization tasks so-called substitution tasks. The method is based on formal algebraic-logical meta model of multistage decision process (ALMM of MDP), that is given in the paper. The paper presents a formal approach for designing constructive algorithms that are based on the method. A general idea of creating substitution tasks for different optimization problems is given. Then creation of substitution tasks, based on automatic analisys of set of non-admissible states is proposed. To illustrate the presented ideas, a scheduling algorithm for a particular NP-hard problem is given and results of computer experiments are presented.