✦ LIBER ✦

An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering

✍ Scribed by Taher Niknam; Babak Amiri; Javad Olamaei; Ali Arefi

Book ID: 111841410
Publisher: SP Zhejiang University Press
Year: 2009
Tongue: English
Weight: 118 KB
Volume: 10
Category: Article
ISSN: 1009-3095
DOI: 10.1631/jzus.a0820196

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient hybrid evolutionary algorit

An efficient hybrid evolutionary algorithm based on PSO and ACO for distribution feeder reconfiguration

✍ Taher Niknam 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

An algorithm for clustering based on non

An algorithm for clustering based on non-smooth optimization techniques

✍ A. M. Bagirov; A. M. Rubinov; N. V. Soukhoroukova; J. Yearwood 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

Constrained optimization based on hybrid

Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique

✍ Yong Wang; Zixing Cai; Yuren Zhou; Zhun Fan 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 412 KB

An efficient evolutionary optimization a

An efficient evolutionary optimization algorithm for multiobjective distribution feeder reconfiguration

✍ Taher Niknam; Mokhtar Sha Sadeghi 📂 Article 📅 2011 🏛 Institute of Control, Robotics and Systems and The 🌐 English ⚖ 404 KB

An efficient gradient-based optimization

An efficient gradient-based optimization algorithm for mechanical systems

✍ Kegl, M. ;Butinar, B. J. ;Kegl, B. 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

A new efficient algorithm based on DC pr

A new efficient algorithm based on DC programming and DCA for clustering

✍ Le Thi Hoai An; M. Tayeb Belghiti; Pham Dinh Tao 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 221 KB

In this paper, a version of K-median problem, one of the most popular and best studied clustering measures, is discussed. The model using squared Euclidean distances terms to which the K-means algorithm has been successfully applied is considered. A fast and robust algorithm based on DC (Difference