| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 474816 | Computers & Operations Research | 2009 | 9 Pages |
Abstract
The paper presents a comparison of ant algorithms and simulated annealing as well as their applications in multicriteria discrete dynamic programming. The considered dynamic process consists of finite states and decision variables. In order to describe the effectiveness of multicriteria algorithms, four measures of the quality of the nondominated set approximations are used.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Sebastian Sitarz,