PKK Library

Your cart is empty.

Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Metaheuristics for Hard Optimization : Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies,… Methods and Case Studies /

By: Dréo, Johann [author.].
Contributor(s): Siarry, Patrick [author.] | Pétrowski, Alain [author.] | Taillard, Eric [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.Description: XII, 372 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540309666.Subject(s): Mathematics | Operations research | Decision making | Computers | Mathematical optimization | Applied mathematics | Engineering mathematics | Control engineering | Robotics | Mechatronics | Engineering economics | Engineering economy | Mathematics | Optimization | Operation Research/Decision Theory | Computing Methodologies | Appl.Mathematics/Computational Methods of Engineering | Engineering Economics, Organization, Logistics, Marketing | Control, Robotics, MechatronicsDDC classification: 519.6 Online resources: Click here to access online
Contents:
Presentation of the Main Metaheuristics -- Simulated Annealing -- Tabu Search -- Evolutionary Algorithms -- Ant Colony Algorithms -- Variants, Extensions and Methodological Advices -- Some Other Metaheuristics -- Extensions -- Methodology -- Case Studies -- Optimization of UMTS Radio Access Networks with Genetic Algorithms -- Genetic Algorithms Applied to Air Traffic Management -- Constraint Programming and Ant Colonies Applied to Vehicle Routing Problems.
In: Springer eBooksSummary: Metaheuristics for Hard Optimization comprises of three parts. The first part is devoted to the detailed presentation of the four most widely known metaheuristics: • the simulated annealing method, • tabu search, • the evolutionary algorithms, • ant colony algorithms. Each one of these metaheuristics is actually a family of methods, of which the essential elements are discussed. In the second part, the book presents some other less widespread metaheuristics, then, extensions of metaheuristics and some ways of research are described . The problem of the choice of a metaheuristic is posed and solution methods are discussed. The last part concentrates on three case studies from telecommunications, air traffic control, and vehicle routing.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK7877
Total holds: 0

Presentation of the Main Metaheuristics -- Simulated Annealing -- Tabu Search -- Evolutionary Algorithms -- Ant Colony Algorithms -- Variants, Extensions and Methodological Advices -- Some Other Metaheuristics -- Extensions -- Methodology -- Case Studies -- Optimization of UMTS Radio Access Networks with Genetic Algorithms -- Genetic Algorithms Applied to Air Traffic Management -- Constraint Programming and Ant Colonies Applied to Vehicle Routing Problems.

Metaheuristics for Hard Optimization comprises of three parts. The first part is devoted to the detailed presentation of the four most widely known metaheuristics: • the simulated annealing method, • tabu search, • the evolutionary algorithms, • ant colony algorithms. Each one of these metaheuristics is actually a family of methods, of which the essential elements are discussed. In the second part, the book presents some other less widespread metaheuristics, then, extensions of metaheuristics and some ways of research are described . The problem of the choice of a metaheuristic is posed and solution methods are discussed. The last part concentrates on three case studies from telecommunications, air traffic control, and vehicle routing.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha