The 0 1 Knapsack Problem A Solution By Genetic Algorithm(1st Edition)

Authors:

A N M Bazlur Rashid

Type:Hardcover/ PaperBack / Loose Leaf
Condition: Used/New

In Stock: 1 Left

Shipment time

Expected shipping within 2 - 3 Days
Access to 35 Million+ Textbooks solutions Free
Ask Unlimited Questions from expert AI-Powered Answers 30 Min Free Tutoring Session
7 days-trial

Total Price:

$0

List Price: $64.53 Savings: $64.53 (100%)
Access to 30 Million+ solutions
Ask 50 Questions from expert AI-Powered Answers 24/7 Tutor Help Detailed solutions for The 0 1 Knapsack Problem A Solution By Genetic Algorithm

Price:

$9.99

/month

Book details

ISBN: 3639295048, 978-3639295047

Book publisher: VDM Verlag Dr. MA 1/4ller

Book Price $0 : 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.