✦ LIBER ✦

99/03196 A new genetic-based tabu search algorithm for unit commitment problem

Publisher: Elsevier Science
Year: 1999
Weight: 211 KB
Volume: 40
Category: Article
ISSN: 0140-6701
DOI: 10.1016/s0140-6701(99)91151-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu-search-based algorithm for contin

A tabu-search-based algorithm for continuous multiminima problems

✍ Francesco Franzè; Nicolò Speciale 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB 👁 2 views

A tabu search-based algorithm for the fu

A tabu search-based algorithm for the fuzzy clustering problem

✍ Khaled S Al-Sultan; Chawki A Fedjki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 597 KB

The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we

98/00375 A combination of the genetic al

98/00375 A combination of the genetic algorithm and Lagrangian relaxation decomposition techniques for the generation unit commitment problem

📂 Article 📅 1998 🏛 Elsevier Science ⚖ 203 KB