Open Access Open Access  Restricted Access Subscription Access

Algorithm for Solving Complex Problems

Adeyemo Temitope T

Abstract


The majority of real-world problems involve maximizing or minimizing a quantity to achieve an optimal outcome. In order to generate a desired solution to real-world problems, optimization techniques are used. Bat Calculation (BA) is a developmental enhancement strategy and it is one of the new metaheuristic calculations for taking care of streamlining issues. It was inspired by the microbats' echolocation technique, which uses a variety of loudnesses and pulse rates to emit sound. The significant constraint of BA is that it will join rapidly at a beginning phase and afterward union rate delayed down subsequently giving a neighborhood ideal arrangement yet not the worldwide ideal arrangement. Branch-and-bound (BnB) is an overall procedure for working on the looking through process by methodicallly counting all up-and-comer arrangements and discarding clearly unthinkable arrangements. This benefit of BnB calculation will be utilized to further develop BA. BnB was utilized to work on the best-tracked down arrangement of BA.


Full Text:

PDF

References


Attia, S., Hamdy, M., O’Brien, W., and Carlucci, S. (2013). Assessing gaps and needs for integrating building performance optimization tools in net zero energy buildings design. Energy and Buildings, 60, 110-124.

Ranut, P. (2012). Optimization and inverse problems in heat transfer (Doctoral dissertation, Ph. D. thesis, University of Udine).

Sinha, N., Chakrabarti, R., and Chattopadhyay, P. K. (2003). Evolutionary programming techniques for economic load dispatch. IEEE Transactions on evolutionary computation, 7(1), 83-94.

Roeva, O. N., and Fidanova, S. S. (2013). Hybrid bat algorithm for parameter identification of an e. coli cultivation process model. Biotechnology & Biotechnological Equipment, 27(6), 4323-4326.

Puchinger, J., and Raidl, G. R. (2005). Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. In International Work-Conference on the Interplay Between Natural and Artificial Computation (pp. 41-53). Springer, Berlin, Heidelberg.

Portmann, M. C., Vignier, A., Dardilhac, D., and Dezalay, D. (1998). Branch and bound crossed with GA to solve hybrid flowshops. European Journal of Operational Research, 107(2), 389-400.

Jourdan, L., Basseur, M., and Talbi, E. G. (2009). Hybridizing exact methods and metaheuristics: A taxonomy. European Journal of Operational Research, 199(3), 620-629.

Basseur, M., Seynhaeve, F., and Talbi, E. G. (2005, March). Path relinking in pareto multi-objective genetic algorithms. In International Conference on Evolutionary Multi-Criterion Optimization (pp. 120-134). Springer, Berlin, Heidelberg.

Tsai, P. W., Pan, J. S., Liao, B. Y., Tsai, M. J., and Istanda, V. (2011). Bat Algorithm Inspired Algorithm for Solving Numerical Optimization Problems. Applied Mechanics and Materials, 37(1): 148-149, doi: 10.4028/www.scientific.net/AMM.148-149.134.

Ahmed Fouad (2015). “Bat Algorithm for Solving Integer Programming Problems” Egyptian Computer Science Journal, 39(1): 25-40.


Refbacks

  • There are currently no refbacks.