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

Rashid, A.N.M. Bazlur

Softcover

ISBN 10: 3639295048 ISBN 13: 9783639295047

Publisher: 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.

About this title

About the Author

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.

Edition details

• Publisher: VDM Verlag Dr. Müller
• Publication date: 2010
• Language: English
• ISBN 10: 3639295048
• ISBN 13: 9783639295047
• Binding: Paperback
• Number of pages: 92