A hybrid modified Bat Algorithm with Dynamic Spiral Method for solving mixed integer non-linear programming optimization

Atia Sonda, Bobby Kurniawan, Faula Arina, Dyah Lintang Trenggonowati, Asep Ridwan, Maria Ulfah, Putro Ferro Ferdinant, Achmad Bahauddin

Abstract


Most optimization problems in engineering are nonlinear, with many constraints. Consequently, finding optimal solutions to such nonlinear problems requires efficient optimization methods. Most of the methods used so far are gradient-based methods. In gradient-based methods, the objective function must be differentiable, and the search for the optimum solution usually starts with a guess-point. For multimodal objectives, the search will likely get stuck at a local optimum. Nowadays, new metaheuristic methods are being developed for solving nonlinear optimization problems. Metaheuristic methods neither require a guess-point nor a derivative of the objective function. Metaheuristic methods, called Bat Algorithm and Spiral Dynamic Method, have been developed for solving optimization problems. Each of the methods has the strength to solve the problem. We propose combining Bat Algorithm (BA) and Dynamic Spiral Method (DSM) for solving mixed integer optimization. The bat Algorithm is used for the exploration stage to find some candidate solutions. Meanwhile, the dynamic spiral method is used in local search to find the best optimum solution. The result obtained by Bat Algorithm-Dynamic Spiral Method (BA-DSM) were more effective than the standard Bat Algorithm in solving the problem.

Keywords


Bat Algorithm; Dynamic Spiral Method; Mixed integer non-linear programming; Optimization

Full Text:

PDF (EN)

References


M. Bierlaire, “Simulation and optimization: A short review,” Transportation Research Part C: Emerging Technologies, vol. 55, pp. 4–13, Jun. 2015, doi: 10.1016/j.trc.2015.01.004.

A. Biswas and C. Hoyle, “A Literature Review: Solving Constrained Non-Linear Bi-Level Optimization Problems With Classical Methods,” Volume 2B: 45th Design Automation Conference, Aug. 2019, doi: 10.1115/detc2019-97192.

C. T. Kelley, “Numerical methods for nonlinear equations,” Acta Numerica, vol. 27, pp. 207–287, May 2018, doi: 10.1017/s0962492917000113.

C. C. Gonzaga and R. M. Schneider, “On the steepest descent algorithm for quadratic functions,” Computational Optimization and Applications, vol. 63, no. 2, pp. 523–542, Aug. 2015, doi: 10.1007/s10589-015-9775-z.

J. Zhang, Z. Yin, P. Chen, and S. Nichele, “Emotion recognition using multi-modal data and machine learning techniques: A tutorial and review,” Information Fusion, vol. 59, pp. 103–126, Jul. 2020, doi: 10.1016/j.inffus.2020.01.011.

N. D. Lagaros, V. Plevris, and N. Ath. Kallioras, “The Mosaic of Metaheuristic Algorithms in Structural Optimization,” Archives of Computational Methods in Engineering, vol. 29, no. 7, pp. 5457–5492, Jul. 2022, doi: 10.1007/s11831-022-09773-0.

K. Hussain, M. N. Mohd Salleh, S. Cheng, and Y. Shi, “Metaheuristic research: a comprehensive survey,” Artificial Intelligence Review, vol. 52, no. 4, pp. 2191–2233, Jan. 2018, doi: 10.1007/s10462-017-9605-z.

D. Delahaye, S. Chaimatanan, and M. Mongeau, “Simulated Annealing: From Basics to Applications,” International Series in Operations Research & Management Science, pp. 1–35, Sep. 2018, doi: 10.1007/978-3-319-91086-4_1.

S. Katoch, S. S. Chauhan, and V. Kumar, “A review on genetic algorithm: past, present, and future,” Multimedia Tools and Applications, vol. 80, no. 5, pp. 8091–8126, Oct. 2020, doi: 10.1007/s11042-020-10139-6.

D. Wang, D. Tan, and L. Liu, “Particle swarm optimization algorithm: an overview,” Soft Computing, vol. 22, no. 2, pp. 387–408, Jan. 2017, doi: 10.1007/s00500-016-2474-6.

V. Kumar and D. Kumar, “A systematic review on Firefly Algorithm: Past, Present, and Future,” Archives of Computational Methods in Engineering, vol. 28, no. 4, pp. 3269–3291, Sep. 2020, doi: 10.1007/s11831-020-09498-y.

M. Abdel-Basset and L. A. Shawky, “Flower pollination algorithm: a comprehensive review,” Artificial Intelligence Review, vol. 52, no. 4, pp. 2533–2557, Mar. 2018, doi: 10.1007/s10462-018-9624-4.

X.-S. Yang, “A new Metaheuristic Bat-Inspired Algorithm,” in Nature Inspired Cooperative Strategies for Optimization (NISCO 2010), Eds. J.R. Gonzales et al.), Studies in Computational Intelligence, Springer Berlin, 284, Springer, 65-74, 2010.

X. -S. Yang, “Bat algorithm for multi-objective optimization,” International Journal of Bio-inspired Computation, vol. 3, no. 5, pp. 267-274, 2011, doi: 10.1504/IJBIC.2011.042259.

Altringham, J. D., Bats: Biology and Behaviour. Oxford Univesity Press: 1996.

K. Tamura and K. Yasuda, “Spiral Dynamics Inspired Optimization,” Journal of Advanced Computational Intelligence and Intelligent Informatics, vol. 15, no. 8, pp. 1116–1122, Oct. 2011, doi: 10.20965/jaciii.2011.p1116.

A. Kania and K. A. Sidarto, “Solving mixed integer nonlinear programming problems using spiral dynamics optimization algorithm,” AIP Conference Proceedings, 2016, doi: 10.1063/1.4942987.

K. A. Sidarto and A. Kania, “Finding all solutions of systems of nonlinear equations using Spiral Dynamics Inspired Optimization with Clustering,” Journal of Advanced Computational Intelligence and Intelligent Informatics, vol. 19, no. 5, pp. 697–707, Sep. 2015, doi: 10.20965/jaciii.2015.p0697.

M. A. Al-Betar and M. A. Awadallah, “Island bat algorithm for optimization,” Expert Systems with Applications, vol. 107, pp. 126–145, Oct. 2018, doi: 10.1016/j.eswa.2018.04.024.

B. R. Adarsh, T. Raghunathan, T. Jayabarathi, and X.-S. Yang, “Economic dispatch using chaotic bat algorithm,” Energy, vol. 96, pp. 666–675, Feb. 2016, doi: 10.1016/j.energy.2015.12.096.




DOI: http://dx.doi.org/10.36055/jiss.v8i2.17315

Refbacks

  • There are currently no refbacks.


  is supported by