Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Computer Engineering
Chaos Firefly Algorithm With Self-Adaptation Mutation Mechanism For Solving Large-Scale Economic Dispatch With Valve-Point Effects And Multiple Fuel Options, Yude Yang, Bori Wei, Hui Liu, Yiyi Zhang, Junhui Zhao, Emad Manla
Chaos Firefly Algorithm With Self-Adaptation Mutation Mechanism For Solving Large-Scale Economic Dispatch With Valve-Point Effects And Multiple Fuel Options, Yude Yang, Bori Wei, Hui Liu, Yiyi Zhang, Junhui Zhao, Emad Manla
Electrical & Computer Engineering and Computer Science Faculty Publications
This paper presents a new metaheuristic optimization algorithm, the firefly algorithm (FA), and an enhanced version of it, called chaos mutation FA (CMFA), for solving power economic dispatch problems while considering various power constraints, such as valve-point effects, ramp rate limits, prohibited operating zones, and multiple generator fuel options. The algorithm is enhanced by adding a new mutation strategy using self-adaptation parameter selection while replacing the parameters with fixed values. The proposed algorithm is also enhanced by a self-adaptation mechanism that avoids challenges associated with tuning the algorithm parameters directed against characteristics of the optimization problem to be solved. The …
Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang
Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang
All Computer Science and Engineering Research
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions. In this paper, we introduce a linear search strategy which we refer to as cut-and-solve and prove optimality and completeness for this method. This search is different from traditional tree searching as there is no branching. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent solutions. When the constraining of the relaxed problem becomes tight enough, its solution value becomes no better than the incumbent solution value. At this …