Artículos relacionados a The 0-1 Knapsack Problem: A solution by Genetic Algorithm

The 0-1 Knapsack Problem: A solution by Genetic Algorithm - Tapa blanda

Rashid, A.N.M. Bazlur

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

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

Biografía del autor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
VDM Verlag Dr. Müller
Año de publicación
2010
Idioma
Inglés
ISBN 10 
3639295048
ISBN 13 
9783639295047
Encuadernación
Tapa blanda
Número de páginas
92
Contacto del fabricante
no disponible
Persona responsable
no disponible