Rashid, A: 0-1 Knapsack Problem A solution by Genetic Algorithm
-
- Englisch ausgewählt
Fr. 68.90
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
03.10.2010
Verlag
VDMSeitenzahl
92
Maße (L/B/H)
22/15/0.6 cm
Gewicht
140 g
Sprache
Englisch
ISBN
978-3-639-29504-7
Optimization algorithms are increasingly popular in engineering design activities like maximizing or minimizing a certain goal, primarily because of the availability and affordability of high speed computers. There is a large class of interesting problems (e.g., optimization) for which no reasonably fast algorithms have been developed. For the last three decades genetic algorithm is being used in structural optimization, function optimization, database query optimization and parametric optimization and so on. The 0-1 knapsack problem is an NP-Hard problem and due to its high computational complexity, algorithms such as backtracking, dynamic programming for exact solution of the 0-1 knapsack problem are not suitable for most real-time decision making applications, such as admission control for interactive multimedia systems or service level agreement management in telecommunication network. The book presents a genetic algorithmic approach for finding near optimal solutions of 0-1 knapsack problem, with reduced computational complexity and is suitable for real-time applications. The analysis should help in the improvement of optimization algorithms and useful in communication fields.
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.