6533b7ddfe1ef96bd1274701

RESEARCH PRODUCT

Learning Automata-Based Solutions to Stochastic Nonlinear Resource Allocation Problems

B. John OommenOle-christopher Granmo

subject

Mathematical optimizationNonlinear systemClass (computer programming)Learning automataKnapsack problemContinuous knapsack problemResource allocationStochastic optimizationComputational intelligenceMathematics

description

“Computational Intelligence” is an extremely wide-ranging and all-encompassing area. However, it is fair to say that the strength of a system that possesses “Computational Intelligence” can be quantified by its ability to solve problems that are intrinsically hard. One such class of NP-Hard problems concerns the so-called family of Knapsack Problems, and in this Chapter, we shall explain how a sub-field of Artificial Intelligence, namely that which involves “Learning Automata”, can be used to produce fast and accurate solutions to “difficult” and randomized versions of the Knapsack problem (KP).

yearjournalcountryeditionlanguage
2009-01-01
https://doi.org/10.1007/978-3-642-04170-9_1