Solving the Economic Dispatch Problem using Tabu Search

Main Article Content

Suwit Kamsawang
Jongrak Boonseng
Sarawut Pothiya

Abstract

This paper presents an efficient approach for solving the economic dispatch problem (EDP) using Tabu Search Algorithm (TSA). Nowadays the TSA is the most popular meta-heuristic technique for optimization because it has the ability to escape local optima by using a short-term memory of recent solutions lead to global optima. In this paper considered three case studies and compared with genetic algorithm (GA) (ธวัช เกิดชื่น และคณะฯ, 2540) and Excel Solver (ES) (วรวัฒน์ เสงี่ยมวิบูล, 2544). The programming for simulation by MATLAB. The results shown solving the EDP using TSA yield solutions better than GA and ES and easier to implementation

Article Details

How to Cite
Kamsawang, S., Boonseng, J., & Pothiya, S. (2013). Solving the Economic Dispatch Problem using Tabu Search. Engineering and Applied Science Research, 30(3), 189–200. Retrieved from https://ph01.tci-thaijo.org/index.php/easr/article/view/6581
Section
ORIGINAL RESEARCH