Articles liés à General Meta-heuristic Search Algorithms: Generalised...
General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems - Couverture souple
Synopsis
In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurVDM Verlag Dr. Müller
- Date d'édition2010
- ISBN 10 3639267680
- ISBN 13 9783639267686
- ReliureBroché
- Langueanglais
- Nombre de pages216
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 60,51
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour General Meta-heuristic Search Algorithms: Generalised...
Image fournie par le vendeur
General Meta-heuristic Search Algorithms
Edité par
VDM Verlag Dr. Müller, 2010
ISBN 10 : 3639267680
ISBN 13 : 9783639267686
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Randall MarcusDr Randall is an associate professor at Bond University, Australia. He is a computer scientist with research interests in combinatorial optimisation, heuristics and search algorithms. Marcus has also published over s. N° de réf. du vendeur 4972472
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
General Meta-heuristic Search Algorithms : Generalised Modelling of Combinatorial Problems
Edité par
VDM Verlag Dr. Müller E.K., 2010
ISBN 10 : 3639267680
ISBN 13 : 9783639267686
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems. N° de réf. du vendeur 9783639267686
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
General Meta-heuristic Search Algorithms
Edité par
VDM Verlag Dr. Müller E.K. Feb 2013, 2013
ISBN 10 : 3639267680
ISBN 13 : 9783639267686
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems. 216 pp. Englisch. N° de réf. du vendeur 9783639267686
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
General Meta-heuristic Search Algorithms
Edité par
VDM Verlag Dr. Müller E.K. Feb 2013, 2013
ISBN 10 : 3639267680
ISBN 13 : 9783639267686
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Neuware -In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 216 pp. Englisch. N° de réf. du vendeur 9783639267686
Quantité disponible : 2 disponible(s)
Image d'archives
General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems
Edité par
VDM Verlag Dr. Müller, 2010
ISBN 10 : 3639267680
ISBN 13 : 9783639267686
Ancien ou d'occasion
Paperback
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA79036392676806
Quantité disponible : 1 disponible(s)