Amazon cover image
Image from Amazon.com

Metaheuristics for hard optimization: methods and case studies Dreo, J.

By: Contributor(s): Material type: TextTextPublication details: Berlin Springer 2006 Description: xii, 369 pISBN:
  • 9783540230229
Subject(s): DDC classification:
  • 519.3
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)

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 on this title.

to post a comment.

Powered by Koha