A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem-Reference-Cited by-同舟云学术

A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

Published:2015 Issue: Volume:2015 Page:1-8
ISSN:1024-123X
Container-title:Mathematical Problems in Engineering
language:en
Short-container-title:Mathematical Problems in Engineering

Author:

Crawford Broderick¹²³,Soto Ricardo¹⁴⁵^ORCID,Berríos Natalia¹,Johnson Franklin¹⁶,Paredes Fernando⁷,Castro Carlos⁸,Norero Enrique⁹

Affiliation:

1. Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile

2. Universidad San Sebastián, 8420524 Santiago, Chile

3. Universidad Central de Chile, 8370178 Santiago, Chile

4. Universidad Autónoma de Chile, 7500138 Santiago, Chile

5. Universidad Cientifica del Sur, Lima 18 Lima, Peru

6. Universidad de Playa Ancha, 2360003 Valparaíso, Chile

7. Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile

8. Universidad Técnica Federico Santa María, 2390123 Valparaíso, Chile

9. Facultad de Ingeniería, Universidad Santo Tomás, 2561694 Viña del Mar, Chile

Abstract

The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a recent swarm metaheuristic technique based on the cat behavior. Domestic cats show the ability to hunt and are curious about moving objects. Based on this, the cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve this problem; our algorithm solves a set of 65 Set Covering Problem instances from OR-Library.

Funder

Consejo Nacional de Ciencia y Tecnología

Publisher

Hindawi Limited

Subject

General Engineering,General Mathematics

Link

http://downloads.hindawi.com/journals/mpe/2015/578541.pdf

Reference47 articles.

1. Cultural Algorithms for the Set Covering Problem

2. Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Autonomous Parameter Balance in Population-Based Approaches: A Self-Adaptive Learning-Based Strategy;Biomimetics;2024-01-31

2. Push-over Analysis of Optimized Steel Frames;Engineering, Technology & Applied Science Research;2022-12-01

3. Meta-Heuristic with Machine Learning-Based Smart e-Health System for Ambient Air Quality Monitoring;Lecture Notes in Electrical Engineering;2022

4. A survey, taxonomy and progress evaluation of three decades of swarm optimisation;Artificial Intelligence Review;2021-11-23

5. Q-Learnheuristics: Towards Data-Driven Balanced Metaheuristics;Mathematics;2021-08-04