Abstract
The Set Covering Problem (SCP) is a well known \(\mathcal {N} \mathcal {P}\)-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods.
The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amini, F., Ghaderi, P.: Hybridization of harmony search and ant colony optimization for optimal locating of structural dampers. Appl. Soft Comput., 2272–2280 (2013)
Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization. Mathematical Programming Studies, vol. 12, pp. 37–60. Elsevier North-Holland, The Netherlands (1980)
Beasley, J., Chu, P.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)
Beasley, J.E.: An algorithm for set covering problem. European Journal of Operational Research 31(1), 85–93 (1987)
Beasley, J.E.: A lagrangian heuristic for set-covering problems. Naval Research Logistics (NRL) 37(1), 151–164 (1990)
Brusco, M., Jacobs, L., Thompson, G.: A morphing procedure to supplement a simulated annealing heuristic for cost and coverage correlated setcovering problems. Annals of Operations Research 86(0), 611–627 (1999)
Caserta, M.: Tabu search-based metaheuristic algorithm for large-scale set covering problems. In: Doerner, K., Gendreau, M., Greistorfer, P., Gutjahr, W., Hartl, R., Reimann, M. (eds.) Metaheuristics. Operations Research/Computer Science Interfaces Series, vol. 39, pp. 43–63. Springer, US (2007)
Crawford, B., Soto, R., Cuesta, R., Paredes, F.: Application of the artificial bee colony algorithm for solving the set covering problem. The Scientific World Journal 2014 (2014)
Crawford, B., Soto, R., Monfroy, E., Palma, W., Castro, C., Paredes, F.: Parameter tuning of a choice-a function based hyperheuristic using particle swarm optimization. Expert Systems with Applications, 1690–1695 (2013)
Crawford, B., Soto, R., Olivares-Surez, M., Paredes, F.: A binary firefly algorithm for the set covering problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Silhavy, P., Prokopova, Z. (eds.) Modern Trends and Techniques in Computer Science. AISC, vol. 285, pp. 65–73. Springer, Heidelberg (2014)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
Goldberg, D.: Real-coded genetic algorithms, virtual alphabets, and blocking, pp. 139–167. Complex Systems (1990)
Han, L., Kendall, G., Cowling, P.: An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem. In: Proceedings of the fourth Asia-Pacific Conference on Simulated Evolution And Learning (SEAL 2002), pp. 267–271. Orchid Country Club, Singapore (2002)
Lin, S.-M.: Analysis of service satisfaction in web auction logistics service using a combination of fruit fly optimization algorithm and general regression neural network. Neural Computing and Applications 22(3–4), 783–791 (2013)
Michalewicz, Z.: Genetic algorithms + data structures = evolution programs, 3rd edn. Springer-Verlag, London (1996)
Mirjalili, S., Lewis, A.: S-shaped versus v-shaped transfer functions for binary particle swarm optimization. Swarm and Evolutionary Computation 9(0), 1–14 (2013)
Pan, W.-T.: A new fruit fly optimization algorithm: Taking the financial distress model as an example. Knowl.-Based Syst. 26, 69–74 (2012)
Ren, Z., Feng, Z., Ke, L., Zhang, Z.: New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering, 774–784 (2010)
Shi, Y., Eberhart, R.: Empirical study of particle swarm optimization. In: Proc. of the Congress on Evolutionary Computation, pp. 1945–1950 (1999)
Wang, L., Zheng, X., Wang, S.: A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowl.-Based Syst. 48, 17–23 (2013)
ze Li, H., Guo, S., jie Li, C., qi Sun, J.: A hybrid annual power load forecasting model based on generalized regression neural network with fruit fly optimization algorithm. Knowledge-Based Systems 37(0), 378–387 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Crawford, B. et al. (2015). A Binary Fruit Fly Optimization Algorithm to Solve the Set Covering Problem. In: Gervasi, O., et al. Computational Science and Its Applications -- ICCSA 2015. ICCSA 2015. Lecture Notes in Computer Science(), vol 9158. Springer, Cham. https://doi.org/10.1007/978-3-319-21410-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-21410-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21409-2
Online ISBN: 978-3-319-21410-8
eBook Packages: Computer ScienceComputer Science (R0)