| Title: | Chapter 16 A Dynamic Optimisation Approach for Ant Colony Optimisation Using the Multidimensional Knapsack Problem |
| DOI No: | 10.1142/9789812701497_0016 |
| Source: | RECENT ADVANCES IN ARTIFICIAL LIFE (pp 215-226)
|
| Author(s): | M. Randall
School of Information Technology, Bond University, QLD 4229, Australia
|
| Abstract: | Meta-heuristic search techniques have been extensively applied to static optimisation problems. These are problems in which the definition and/or the data remain fixed throughout the process of solving the problem. Many real-world problems, particularly in transportation, telecommunications and manufacturing, change over time as new events occur, thus altering the solution space. This paper explores methods for solving these problems with ant colony optimisation. A method of adapting the general algorithm to a range of problems is presented. This paper shows the development of a small prototype system to solve dynamic multidimensional knapsack problems. This system is found to be able to rapidly adapt to problem changes. |
| Full Text: | View full text in PDF format (550KB) |
| TOC: | Back to Table of Contents |
|
|
