Solution of Economic Load Dispatch (ELD) Problem by Path Relinking (PR) Algorithm
Author(s) -
Christos Drosos,
Ioannis Trichas,
Aristidis Vlachos
Publication year - 2016
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2016910522
Subject(s) - computer science , path (computing) , mathematical optimization , algorithm , operations research , operating system , mathematics
This paper presents a solution of the Economic Load Dispatch (ELD) problem, using the Path Relinking Algorithm (PR). Generally, PR is a population-based meta-heuristic technique to integrate intensification and diversification strategies in a search procedure. Also, to explore trajectories that connect elite solutions .The economic load dispatch problem is formulated as the minimization of the production cost function, expressed as a quadratic polynomial, subject to the power balance constraints and to the generation limits constraints. The proposed approach has been applied in five generators units. The comparison with the real-coded genetic algorithm (RCGAs), the binary-coded genetic algorithm (BCGAs) and the classical optimization technique of QuasiNewton, demonstrates the superiority of the PR algorithm and confirms its potential to solve the ELD problem. General Terms Mathematical programming; numerical optimization; metaheuristics algorithms;
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom