Description: Distributed Memetic Algorithms for Graph-Theoretical Combinatorial Optimization Problems by Thomas Fischer Estimated delivery 3-12 business days Format Paperback Condition Brand New Description In this thesis, three different graph-theoretical combinatorial optimization problems have been addressed by memetic and distributed algorithms. These three problems include the well-known Travelling Salesman Problem (TSP) and the two communication problems Optimum Communication Spanning Tree Problem (OCST) and Routing and Wavelength Assignment Problem (RWA). The focus of the research presented in this thesis was on developing techniques to handle large instances of the above problems, where large refers to problem sizes larger than those addressed in related works or large enough to pose a challenge for state-of-the-art heuristic solvers. For the TSP, a large number of publications and algorithms are available, so here research centers on how to solve large problem instances either by reducing the size of problem instances by fixing edges of a problem instance or by distributing the computation in sets of cluster nodes. For the OCST, a given local search algorithm was modified to handle large problem instances. The new local search algorithm was embedded into a distributed memetic algorithm with problem-specific recombination operators.For the RWA, most components of a distributed memetic algorithm were developed for this thesis, including local search, recombination, and distribution. To handle large problem instances, the algorithm was enhanced by a multilevel component to reduce the problem size. Details ISBN 383252178X ISBN-13 9783832521783 Title Distributed Memetic Algorithms for Graph-Theoretical Combinatorial Optimization Problems Author Thomas Fischer Format Paperback Year 2009 Pages 327 Publisher Logos Verlag Berlin GmbH GE_Item_ID:137253696; About Us Grand Eagle Retail is the ideal place for all your shopping needs! With fast shipping, low prices, friendly service and over 1,000,000 in stock items - you're bound to find what you want, at a price you'll love! Shipping & Delivery Times Shipping is FREE to any address in USA. Please view eBay estimated delivery times at the top of the listing. Deliveries are made by either USPS or Courier. We are unable to deliver faster than stated. International deliveries will take 1-6 weeks. NOTE: We are unable to offer combined shipping for multiple items purchased. This is because our items are shipped from different locations. Returns If you wish to return an item, please consult our Returns Policy as below: Please contact Customer Services and request "Return Authorisation" before you send your item back to us. Unauthorised returns will not be accepted. Returns must be postmarked within 4 business days of authorisation and must be in resellable condition. Returns are shipped at the customer's risk. We cannot take responsibility for items which are lost or damaged in transit. For purchases where a shipping charge was paid, there will be no refund of the original shipping charge. Additional Questions If you have any questions please feel free to Contact Us. Categories Baby Books Electronics Fashion Games Health & Beauty Home, Garden & Pets Movies Music Sports & Outdoors Toys
Price: 89.53 USD
Location: Fairfield, Ohio
End Time: 2024-11-14T04:07:31.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
ISBN-13: 9783832521783
Book Title: Distributed Memetic Algorithms for Graph-Theoretical Combinatoria
Number of Pages: 327 Pages
Language: English
Publication Name: Distributed Memetic Algorithms for Graph-Theoretical Combinatorial Optimization Problems
Publisher: Logos Verlag Berlin
Publication Year: 2009
Subject: Computer Science
Type: Textbook
Item Weight: 6.7 Oz
Item Length: 8.3 in
Author: Thomas Fischer
Subject Area: Computers
Item Width: 5.7 in
Format: Trade Paperback