Eagle Strategy based Crow Search Algorithm for solving Unit Commitment Problem
Eagle strategy is a two-stage optimization strategy, which is inspired by the observation of the hunting behavior of eagles in nature. In this two-stage strategy, the first stage explores the search space globally by using a Levy flight; if it finds a promising solution, then an intensive local sear...
Saved in:
Main Authors: | , , , |
---|---|
Format: | EJournal Article |
Published: |
Institute of Advanced Engineering and Science,
2018-10-01.
|
Subjects: | |
Online Access: | Get fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
LEADER | 03093 am a22003253u 4500 | ||
---|---|---|---|
001 | ijeecs11337_9296 | ||
042 | |a dc | ||
100 | 1 | 0 | |a Habachi, Rachid |e author |
100 | 1 | 0 | |e contributor |
700 | 1 | 0 | |a Touil, Achraf |e author |
700 | 1 | 0 | |a Charkaoui, Abdelkabir |e author |
700 | 1 | 0 | |a Echchatbi, Abdelwahed |e author |
245 | 0 | 0 | |a Eagle Strategy based Crow Search Algorithm for solving Unit Commitment Problem |
260 | |b Institute of Advanced Engineering and Science, |c 2018-10-01. | ||
500 | |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/11337 | ||
520 | |a Eagle strategy is a two-stage optimization strategy, which is inspired by the observation of the hunting behavior of eagles in nature. In this two-stage strategy, the first stage explores the search space globally by using a Levy flight; if it finds a promising solution, then an intensive local search is employed using a more efficient local optimizer, such as hillclimbing and the downhill simplex method. Then, the two-stage process starts again with new global exploration, followed by a local search in a new region. One of the remarkable advantages of such a combina-tion is to use a balanced tradeoff between global search (which is generally slow) and a rapid local search. The crow search algorithm (CSA) is a recently developed metaheuristic search algorithm inspired by the intelligent behavior of crows.This research article integrates the crow search algorithm as a local optimizer of Eagle strategy to solve unit commitment (UC) problem. The Unit commitment problem (UCP) is mainly finding the minimum cost schedule to a set of generators by turning each one either on or off over a given time horizon to meet the demand load and satisfy different operational constraints. There are many constraints in unit commitment problem such as spinning reserve, minimum up/down, crew, must run and fuel constraints. The proposed strategy ES-CSA is tested on 10 to 100 unit systems with a 24-h scheduling horizon. The effectiveness of the proposed strategy is compared with other well-known evolutionary, heuristics and meta-heuristics search algorithms, and by reported numerical results, it has been found that proposed strategy yields global results for the solution of the unit commitment problem. | ||
540 | |a Copyright (c) 2018 Institute of Advanced Engineering and Science | ||
540 | |a http://creativecommons.org/licenses/by-nc/4.0 | ||
546 | |a eng | ||
690 | |a Smart Grid | ||
690 | |a : Unit Commitment Problem (UCP); Eagle Strategy (ES); Crow Search Algorithm (CSA); Lambda-iteration method | ||
655 | 7 | |a info:eu-repo/semantics/article |2 local | |
655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
655 | 7 | |2 local | |
786 | 0 | |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 12, No 1: October 2018; 17-29 | |
786 | 0 | |n 2502-4760 | |
786 | 0 | |n 2502-4752 | |
786 | 0 | |n 10.11591/ijeecs.v12.i1 | |
787 | 0 | |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/11337/9296 | |
856 | 4 | 1 | |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/11337/9296 |z Get fulltext |