Mohlo by se vám také líbit

Více informací o knize General Meta-heuristic Search Algorithms

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 219 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics

• Plný název: General Meta-heuristic Search Algorithms
• Autor: Marcus Randall
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 216
• EAN: 9783639267686
• ISBN: 3639267680
• ID: 06834062
• Nakladatelství: VDM Verlag
• Hmotnost: 322 g
• Rozměry: 229 × 152 × 12 mm
• Datum vydání: 11. June 2010

Oblíbené z jiného soudku

---

---

---