General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems - Softcover
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.
"synopsis" may belong to another edition of this title.
About the Author
Dr 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 sixty peer reviewed works including a number of books, chapters for books, journal and conference articles.
"About this title" may belong to another edition of this title.
Search results for General Meta-heuristic Search Algorithms: Generalised...
Seller Image
General Meta-heuristic Search Algorithms
Published by
VDM Verlag Dr. Müller E.K. Feb 2013, 2013
ISBN 10: 3639267680
ISBN 13: 9783639267686
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639267686
Seller Image
General Meta-heuristic Search Algorithms
Published by
VDM Verlag Dr. Müller, 2010
ISBN 10: 3639267680
ISBN 13: 9783639267686
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Kartoniert / Broschiert. Condition: 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. Seller Inventory # 4972472
Buy New
£ 54.62
£ 42.93 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
General Meta-heuristic Search Algorithms | Generalised Modelling of Combinatorial Problems
Published by
VDM Verlag Dr. Müller e.K., 2013
ISBN 10: 3639267680
ISBN 13: 9783639267686
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. General Meta-heuristic Search Algorithms | Generalised Modelling of Combinatorial Problems | Marcus Randall | Taschenbuch | 216 S. | Englisch | 2013 | VDM Verlag Dr. Müller e.K. | EAN 9783639267686 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu. Seller Inventory # 101046038
Seller Image
General Meta-heuristic Search Algorithms
Published by
VDM Verlag Dr. Müller E.K. Feb 2013, 2013
ISBN 10: 3639267680
ISBN 13: 9783639267686
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639267686
Seller Image
General Meta-heuristic Search Algorithms : Generalised Modelling of Combinatorial Problems
Published by
VDM Verlag Dr. Müller E.K., 2010
ISBN 10: 3639267680
ISBN 13: 9783639267686
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639267686
Stock Image
General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA79036392676806
Buy Used
£ 138
£ 25 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available