24
Views
9
CrossRef citations to date
0
Altmetric
Articles

Bat algorithm applied to continuous constrained optimization problems

&
Pages 57-75 | Received 01 Jan 2019, Published online: 05 Mar 2020

References

  • Jong-Bae Park, Yun-Won Jeong, Woo-Nam Lee, and Joong-Rin Shin, “An improved particle swarm optimization for economic dispatch problems with non-smooth cost functions,” in 2006 IEEE Power Engineering Society General Meeting, 2006, vol. 25, no. 1, p. 7 pp.
  • Xiaohong Guan, P. B. Luh, and Lan Zhang, “Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling,” IEEE Trans. Power Syst., vol. 10, no. 2, pp. 772–778, May 1995. doi: 10.1109/59.387916
  • J. S. Al-Sumait, A. K. AL-Othman, and J. K. Sykulski, “Application of pattern search method to power system valve-point economic load dispatch,” Int. J. Electr. Power Energy Syst., vol. 29, no. 10, pp. 720–730, 2007. doi: 10.1016/j.ijepes.2007.06.016
  • T. Ratniyomchai, A. Oonsivilai, P. Pao-la-or, and T. Kulworawanichpong, “Economic load dispatch using improved harmony search,” WSEAS Trans. Syst. Control, vol. 5, no. 4, pp. 248–257, 2010.
  • C. H. Chen and S. N. Yeh, “Particle swarm optimization for economic power dispatch with valve-point effects,” 2006 IEEE PES Transm. Distrib. Conf. Expo. Lat. Am. TDC’06, vol. 00, no. 4, pp. 1–5, 2006.
  • K. Borana, R. B. Patel, and B. P. Singh, “Genetic Algorithms And Its Application To Economic Load Dispatch,” 2010, pp. 239–243.
  • K. P. Wong and C. C. Fung, “Simulated annealing based economic dispatch algorithm,” IEE Proc. C Gener. Transm. Distrib., vol. 140, no. 6, p. 509, 1993. doi: 10.1049/ip-c.1993.0074
  • I. El-Amin, S. Duffuaa, and M. Abbas, “A Tabu search algorithm for maintenance scheduling of generating units,” Electr. Power Syst. Res., vol. 54, no. 2, pp. 91–99, May 2000. doi: 10.1016/S0378-7796(99)00079-6
  • I. Karakonstantis and A. Vlachos, “The ant colony optimisation solving continuous problems,” Int. J. Comput. Intell. Stud., vol. 2, no. 3/4, p. 350, 2013. doi: 10.1504/IJCISTUDIES.2013.057637
  • Z. Wu and Y. Wang, “An optimal dispatch model of power economic load system based on modified bat algorithm,” J. Discret. Math. Sci. Cryptogr., vol. 21, no. 6, pp. 1359–1362, Aug. 2018. doi: 10.1080/09720529.2018.1526765
  • C. Wang, “The improved elite multi-parent hybrid optimization algorithm based on bat algorithm to optimum design of automobile gearbox,” J. Discret. Math. Sci. Cryptogr., vol. 21, no. 2, pp. 513–517, Feb. 2018. doi: 10.1080/09720529.2018.1449353
  • H. Barati and M. Sadeghi, “An efficient hybrid MPSO-GA algorithm for solving non-smooth/non-convex economic dispatch problem with practical constraints,” Ain Shams Eng. J., Sep. 2016.
  • X. S. Yang, “A new metaheuristic Bat-inspired Algorithm,” Stud. Comput. Intell., vol. 284, pp. 65–74, 2010.
  • X. Yang and A. Hossein Gandomi, “Bat algorithm: a novel approach for global engineering optimization,” Eng. Comput., vol. 29, no. 5, pp. 464–483, 2012. doi: 10.1108/02644401211235834
  • X.-S. Yang, S. Deb, M. Loomes, and M. Karamanoglu, “A framework for self-tuning optimization algorithm,” Neural Comput. Appl., vol. 23, no. 7–8, pp. 2051–2057, Dec. 2013. doi: 10.1007/s00521-013-1498-4
  • B. R. Feiring, D. T. Phillips, and G. L. Hogg, “Penalty function techniques: A tutorial,” Comput. Ind. Eng., vol. 9, no. 4, pp. 307–326, Jan. 1985. doi: 10.1016/0360-8352(85)90019-1
  • R. Hooke and T. A. Jeeves, “‘Direct Search”’ Solution of Numerical and Statistical Problems,’” J. ACM, vol. 8, no. 2, pp. 212–229, Apr. 1961. doi: 10.1145/321062.321069
  • “MATLAB Optimization Toolbox.” The MathWorks, Natick, MA, USA, 2018.
  • X.-S. Yang, “Bat Algorithm,” MathWorks File Exchange. [Online]. Available: https://www.mathworks.com/matlabcentral/fileexchange/37582-bat-algorithm-demo. [Accessed: 10-Oct-2018].

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.