Abstract
The Electromagnetism-like algorithm is a relatively modern metaheuristic based on the attraction-repulsion mechanism of particles in the context of electromagnetism theory. This paper focuses on improving performance of this metaheuristic when solving binary problems. To this end, we incorporate three elements: pre-processing, repairing, and transfers functions. The pre-processing allows to reduce the size of instances, while repairing eliminates those potential solutions that violate the constraints. Finally, the incorporation of a transfer function adapts the solutions to a binary domains. We illustrate experimental results where the incorporation of these elements improve the resolution phase, when solving a set of 65 non-unicost set covering problems.
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
Beasley, J.E.: A lagrangian heuristic for set-covering problems. Naval Research Logistics (NRL) 37(1), 151–164 (1990)
Birbil, S.I., Fang, S.-C.: An electromagnetism-like mechanism for global optimization. Journal of Global Optimization 25(3), 263–282 (2003)
Ceria, S., Nobili, P., Sassano, A.: Annotated Bibliographies in Combinatorial Optimization. J. Wiley and Sons (1997)
Ceria, S., Nobili, P., Sassano, A.: A Lagrangian-based heuristic for large-scale set covering problems. Mathematical Programming 81(2), 215–228 (1998)
Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)
Grossman, T., Wool, A.: Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research 101(1), 81–92 (1997)
Hochba, D.S.: Approximation algorithms for NP-hard problems. ACM SIGACT News 28(2), 40–52 (1997)
Krarup, J., Bilde, O.: Plant Location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems. Springer (1977)
Mirjalili, S., Hashim, S., Taherzadeh, G., Mirjalili, S.Z., Salehi, S.: A Study of Different Transfer Functions for Binary Version of Particle Swarm Optimization. In: GEM 2011. CSREA Press (2011)
Pezzella, F., Faggioli, E.: Solving large set covering problems for crew scheduling. Top 5(1), 41–59 (1997)
Ren, Z.-G., Feng, Z.-R., Ke, L.-J., Zhang, Z.-J.: New ideas for applying ant colony optimization to the set covering problem. Computers & Industrial Engineering 58(4), 774–784 (2010)
Rubin, J.: A technique for the solution of massive set covering problems, with application to airline crew scheduling. Transportation Science 7(1), 34–48 (1973)
Soto, R., Crawford, B., Galleguillos, C., Monfroy, E., Paredes, F.: A hybrid AC3-tabu search algorithm for solving Sudoku puzzles. Expert Systems with Applications 40(15), 5817–5821 (2013)
Soto, R., Crawford, B., Galleguillos, C., Monfroy, E., Paredes, F.: A Pre-filtered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems. The Scientific World Journal, Article ID 465359, 12 pages (2014)
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
Soto, R., Crawford, B., Muñoz, A., Johnson, F., Paredes, F. (2015). Pre-processing, Repairing and Transfer Functions Can Help Binary Electromagnetism-Like Algorithms. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Artificial Intelligence Perspectives and Applications. Advances in Intelligent Systems and Computing, vol 347. Springer, Cham. https://doi.org/10.1007/978-3-319-18476-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-18476-0_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18475-3
Online ISBN: 978-3-319-18476-0
eBook Packages: EngineeringEngineering (R0)