Skip to main content

Binary Bat Algorithm: On The Efficiency of Mapping Functions When Handling Binary Problems Using Continuous-variable-based Metaheuristics

  • Conference paper

Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT,volume 456)

Abstract

Global optimisation plays a critical role in today’s scientific and industrial fields. Optimisation problems are either continuous or combinatorial depending on the nature of the parameters to optimise. In the class of combinatorial problems, we find a sub-category which is the binary optimisation problems. Due to the complex nature of optimisation problems, exhaustive search-based methods are no longer a good choice. So, metaheuristics are more and more being opted in order to solve such problems. Some of them were designed originally to handle binary problems, whereas others need an adaptation to acquire this capacity. One of the principal adaptation schema is the use of a mapping function to decode real-valued solutions into binary-valued ones. The Antenna Positioning Problem (APP) is an NP-hard binary optimisation problem in cellular phone networks (2G, EDGE, GPRS, 3G, 3G + , LTE, 4G). In this paper, the efficiency of the principal mapping functions existing in the literature is investigated through the proposition of five binary variants of one of the most recent metaheuristic called the Bat Algorithm (BA). The proposed binary variants are evaluated on the APP, and have been tested on a set of well-known benchmarks and given promising results.

Keywords

  • Genetic Algorithm
  • Mapping Function
  • Sigmoid Function
  • Solution Vector
  • Binary Problem

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. Alba, E., Molina, G., Chicano, J.F.: Optimal placement of antennae using metaheuristics. In: Boyanov, T., Dimova, S., Georgiev, K., Nikolov, G. (eds.) NMA 2006. LNCS, vol. 4310, pp. 214–222. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  2. Burnwal, S., Deb, S.: Scheduling optimization of flexible manufacturing system using cuckoo search-based approach. The International Journal of Advanced Manufacturing Technology 64(5-8), 951–959 (2013)

    CrossRef  Google Scholar 

  3. Calegari, P., Guidec, F., Kuonen, P.: A parallel genetic approach to transceiver placement optimisation. In: Proceedings of the SIPAR Workshop: Parallel and Distributed Systems, pp. 21–24 (1996)

    Google Scholar 

  4. Calegari, P., Guidec, F., Kuonen, P., Kobler, D.: Parallel island-based genetic algorithm for radio network design. J. Parallel Distrib. Comput. 47(1), 86–90 (1997)

    CrossRef  Google Scholar 

  5. Congying, L., Huanping, Z., Xinfeng, Y.: Particle swarm optimization algorithm for quadratic assignment problem. In: Proceedings of the International Conference on Computer Science and Network Technology (ICCSNT), vol. 3, pp. 1728–1731 (2011)

    Google Scholar 

  6. Costa, M., Rocha, A.A.M., Francisco, B.R., Fernandes, M.E.: Heuristic-based firefly algorithm for bound constrained nonlinear binary optimization. Advances in Operations Research 1( 215182), 12 (2014)

    MathSciNet  Google Scholar 

  7. Liu, Q., Lu, W., Xu, W.: Spectrum allocation optimization for cognitive radio networks using binary firefly algorithm. In: Proceedings of the International Conference on Innovative Design and Manufacturing (ICIDM), pp. 257–262 (2014)

    Google Scholar 

  8. Palit, S., Sinha, S., Molla, M., Khanra, A.: A cryptanalytic attack on the knapsack cryptosystem using binary firefly algorithm. In: Proceedings of the 2nd International Conference on Computer and Communication Technology (ICCCT), pp. 428–432 (2011)

    Google Scholar 

  9. Pampara, G., Engelbrecht, A.: Binary artificial bee colony optimization. In: Proceedings of the IEEE Symposium on Swarm Intelligence (SIS), April 11-15, pp. 1–8 (2011)

    Google Scholar 

  10. Pampara, G., Engelbrecht, A., Franken, N.: Binary differential evolution. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2006, pp. 1873–1879 (2006)

    Google Scholar 

  11. Pampara, G., Franken, N., Engelbrecht, A.: Combining particle swarm optimisation with angle modulation to solve binary problems. In: Proceedings of the Congress on Evolutionary Computation, CEC 2005, pp. 89–96 (2005)

    Google Scholar 

  12. Segura, C., Segredo, E., González, Y., León, C.: Multiobjectivisation of the antenna positioning problem. In: International Symposium on Distributed Computing and Artificial Intelligence (DCAI), pp. 319–327 (2011)

    Google Scholar 

  13. Swagatam, D., Rohan, M., Rupam, K., Thanos, V.: Multi-user detection in multi-carrier CDMA wireless broadband system using a binary adaptive differential evolution algorithm. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, GECCO 2013, pp. 1245–1252 (2013)

    Google Scholar 

  14. Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Nature Inspired Cooperative Strategies for Optimization (NICSO), vol. 284, pp. 65–74. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zakaria Abd El Moiz Dahi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2015 IFIP International Federation for Information Processing

About this paper

Cite this paper

Dahi, Z.A.E.M., Mezioud, C., Draa, A. (2015). Binary Bat Algorithm: On The Efficiency of Mapping Functions When Handling Binary Problems Using Continuous-variable-based Metaheuristics. In: Amine, A., Bellatreche, L., Elberrichi, Z., Neuhold, E., Wrembel, R. (eds) Computer Science and Its Applications. CIIA 2015. IFIP Advances in Information and Communication Technology, vol 456. Springer, Cham. https://doi.org/10.1007/978-3-319-19578-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19578-0_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19577-3

  • Online ISBN: 978-3-319-19578-0

  • eBook Packages: Computer ScienceComputer Science (R0)