The 0-1 Knapsack Problem: A solution by Genetic Algorithm - Couverture souple

Rashid, A.N.M. Bazlur

 
9783639295047: The 0-1 Knapsack Problem: A solution by Genetic Algorithm
Couverture souple
ISBN 10 : 3639295048 ISBN 13 : 9783639295047
Editeur : VDM Verlag Dr. Müller, 2010

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Biographie de l'auteur

M.Sc. Engg.(Information & Communication Technology) at Bangladesh University of Engineering & Technology, B.Sc. Engg.(Computer Science & Engineering) at Rajshahi University of Engineering & Technology. Oracle certified professional DBA. 5 years of professional experience. Lecturer of Computer Science & Engineering at Comilla University, Bangladesh.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
VDM Verlag Dr. Müller
Date d'édition
2010
Langue
anglais
ISBN 10 
3639295048
ISBN 13 
9783639295047
Reliure
Broché
Nombre de pages
92
Coordonnées du fabricant
non disponible
Personne responsable
non disponible