A hybrid multi-agent based particle swarm optimization algorithm for economic power dispatch

Kumar, Rajesh; Sharma, Devendra; Shrivastava, Abhinav

doi:10.1016/j.ijepes.2010.06.021

Cited by 143 publications

(54 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Rajesh Kumar et al presented a new multi-agent based hybrid particle swarm optimization technique applied to the economic power dispatch, the algorithm integrates the deterministic search, the Multi-agent system, PSO algorithm and the bee decision-making process [13]. Yannis Marinakis and Magdalene Marinaki analyzed the probabilistic traveling salesman problem and proposed a new hybrid algorithmic nature inspired approach based on PSO to solve the problem [14].…”

Section: Results Based On Particle Swarm Optimizationmentioning

confidence: 99%

Particle Swarm Optimization Algorithm for Multisalesman Problem with Time and Capacity Constraints

Pang¹,

Tan²,

Dai³

et al. 2013

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Classic multiple traveling salesman problem (MTSP) requires to find the k closed circular paths which minimize the sum of the path lengths, and each vertex is visited only once by a salesman. This paper presents an optimized model for the balanced Multiple-salesman Problem with time and capacity constraints, it requires that a salesman visits each vertex at least once and returns to the starting vertex within given time. The balanced MSP is more widely used than MTSP. We describe a particle swarm optimization algorithm for balanced MSP and explain its simple application in the Post Office Scheduling Problem. We demonstrate the effectiveness of the model and algorithm through a case study.

show abstract

Section: Results Based On Particle Swarm Optimizationmentioning

confidence: 99%

Particle Swarm Optimization Algorithm for Multisalesman Problem with Time and Capacity Constraints

Pang¹,

Tan²,

Dai³

et al. 2013

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…The variables ( , , ) and ( , , ) are introduced to record startup and shutdown duration of each unit attached to th frog at th period. The record process is described in (25). Meanwhile, the startup and shutdown durations stored in ( , , ) and ( , , ) are verified whether the minimum up and down time constraint is satisfied or not.…”

Section: Strategies For Handling the Constraints (1) The Supplement Amentioning

confidence: 99%

“…Adopt the supplement and repair strategy of unit reserve capacity to satisfy the sinning reserve constraints. Record the duration of unit startup and shutdown according to (25). Regulate the unit state at each period with the repair strategy of minimum startup and shutdown time in order to satisfy constraint E.…”

Section: The Coupled External and Internal Model For Sthgsmentioning

confidence: 99%

The Improved Binary-Real Coded Shuffled Frog Leaping Algorithm for Solving Short-Term Hydropower Generation Scheduling Problem in Large Hydropower Station

Yang

et al. 2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

The short-term hydro generation scheduling (STHGS) decomposed into unit commitment (UC) and economic load dispatch (ELD) subproblems is complicated problem with integer optimization, which has characteristics of high dimension, nonlinear and complex hydraulic and electrical constraints. In this study, the improved binary-real coded shuffled frog leaping algorithm (IBR-SFLA) is proposed to effectively solve UC and ELD subproblems, respectively. For IB-SFLA, the new grouping strategy is applied to overcome the grouping shortage of SFLA, and modified search strategies for each type of frog subpopulation based on normal cloud model (NCM) and chaotic theory are introduced to enhance search performance. The initialization strategy with chaos theory and adaptive frog activation mechanism are presented to strengthen performance of IR-SFLA on ELD subproblem. Furthermore, to solve ELD subproblem, the optimal economic operation table is formed using IR-SFLA and invoked from database. Moreover, reserve capacity supplement and repair, and minimum on and off time repairing strategies are applied to handle complex constraints in STHGS. Finally, the coupled external and internal model corresponding to UC and ELD subproblems is established and applied to solve STHGS problem in Three Gorges hydropower station. Simulation results obtained from IBR-SFLA are better than other compared algorithms with less water consumption. In conclusion, to solve STHGS optimization problem, the proposed IBR-SFLA presents outstanding performance on solution precision and convergence speed compared to traditional SFLA effectively and outperforms the rivals to get higher precision solution with improving the utilization rate of waterpower resources.

show abstract

“…The added sinusoidal term in the production cost function reflects the effect of valve-points. The DED problem is non-convex and non-differentiable considering valve-point effects [35].…”

Section: Dynamic Economic Dispatch Problem Formulationmentioning

confidence: 99%

Imperialist competitive algorithm for solving non-convex dynamic economic power dispatch

Mohammadi‐Ivatloo

Rabiee

Soroudi

et al. 2012

Energy

133

View full text Add to dashboard Cite

Publication informationEnergy, 44 (1): 228-240Publisher Elsevier Item record/more information http://hdl.handle.net/10197/6166 Publisher's statementThis is the author's version of a work that was accepted for publication in Energy. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Energy (VOL 44, ISSUE 1, (2012)

show abstract

A hybrid multi-agent based particle swarm optimization algorithm for economic power dispatch

Cited by 143 publications

References 11 publications

Particle Swarm Optimization Algorithm for Multisalesman Problem with Time and Capacity Constraints

Particle Swarm Optimization Algorithm for Multisalesman Problem with Time and Capacity Constraints

The Improved Binary-Real Coded Shuffled Frog Leaping Algorithm for Solving Short-Term Hydropower Generation Scheduling Problem in Large Hydropower Station

Imperialist competitive algorithm for solving non-convex dynamic economic power dispatch

Contact Info

Product

Resources

About