A Binary Percentile Sin-Cosine Optimisation Algorithm Applied to the Set Covering Problem

Today there is a line of research-oriented to the design of algorithms inspired by nature. Many of these algorithms work in continuous spaces. On the other hand, there is a great amount of combinatorial optimization problems (COP) which have application in the industry. The adaptation of these continuous algorithms to resolve COP is of great interest in the area of computer science. In this article we apply the percentile concept to perform the binary adaptation of the Sine-Cosine algorithm. To evaluate the results of this adaptation we will use the set covering problem (SCP). The experiments are designed with the objective of demonstrating the usefulness of the percentile concept in binarization. In addition, we verify the effectiveness of our algorithm through reference instances. The results indicate that the binary Percentile Sine-Cosine Optimization Algorithm (BPSCOA) obtains adequate results when evaluated with a combinatorial problem such as the SCP.

[1]  François Soumis,et al.  Airline crew scheduling: models, algorithms, and data sets , 2014, EURO J. Transp. Logist..

[2]  Eduardo Graells-Garrido,et al.  Visual Exploration of Urban Dynamics Using Mobile Data , 2015, UCAmI.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Yun Lu,et al.  An OR Practitioner's Solution Approach for the Set Covering Problem , 2015, Int. J. Appl. Metaheuristic Comput..

[5]  Broderick Crawford,et al.  A Percentile Transition Ranking Algorithm Applied to Knapsack Problem , 2017 .

[6]  Seyedali Mirjalili,et al.  SCA: A Sine Cosine Algorithm for solving optimization problems , 2016, Knowl. Based Syst..

[7]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[8]  Julián M. Ortiz,et al.  Urban Dynamic Estimation Using Mobile Phone Logs and Locally Varying Anisotropy , 2017 .

[9]  José García,et al.  A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem , 2017, ICHSA.

[10]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[11]  Eduardo Graells-Garrido,et al.  Sensing Urban Patterns with Antenna Mappings: The Case of Santiago, Chile , 2016, Sensors.

[12]  Tamás Kis,et al.  Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price , 2017, Central European Journal of Operations Research.

[13]  Damian Kelty-Stephen,et al.  Cascade-Driven Series with Narrower Multifractal Spectra Than Their Surrogates: Standard Deviation of Multipliers Changes Interactions across Scales , 2017, Complex..

[14]  François Soumis,et al.  THE OPERATIONAL FLIGHT AND MULTI-CREW SCHEDULING PROBLEM , 2000 .

[15]  José García,et al.  A Distributed K-Means Segmentation Algorithm Applied to Lobesia botrana Recognition , 2017, Complex..

[16]  José García,et al.  A Meta-Optimization Approach for Covering Problems in Facility Location , 2017, WEA.

[17]  Yair Neuman,et al.  A Novel Procedure for Measuring Semantic Synergy , 2017, Complex..

[18]  José García,et al.  Putting Continuous Metaheuristics to Work in Binary Search Spaces , 2017, Complex..

[19]  Gilbert Laporte,et al.  A metaheuristic for the time-dependent pollution-routing problem , 2017, Eur. J. Oper. Res..

[20]  Yung-Keun Kwon,et al.  A novel mutual information-based Boolean network inference method from time-series gene expression data , 2017, PloS one.

[21]  Abdolreza Hatamlou,et al.  Black hole: A new heuristic optimization approach for data clustering , 2013, Inf. Sci..

[22]  Mohsen Khatibinia,et al.  Accelerated multi-gravitational search algorithm for size optimization of truss structures , 2018, Swarm Evol. Comput..

[23]  S. Balaji,et al.  A new approach for solving set covering problem using jumping particle swarm optimization method , 2015, Natural Computing.

[24]  Zhiming Cai,et al.  Gravity-based heuristic for set covering problems and its application in fault diagnosis , 2012 .

[25]  José García,et al.  A Percentile Transition Ranking Algorithm Applied to Binarization of Continuous Swarm Intelligence Metaheuristics , 2018, SCDM.

[26]  José García,et al.  A k-means binarization framework applied to multidimensional knapsack problem , 2018, Applied Intelligence.

[27]  José García,et al.  Constructive Metaheuristics for the Set Covering Problem , 2018, BIOMA.

[28]  José García,et al.  A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems , 2018, Complex..