A binary cat swarm optimization algorithm for the non-unicost set covering problem
type: Item
instance of: scholarly article
title: A binary cat swarm optimization algorithm for the non-unicost set covering problem
zbMATH Open document ID: 1394.90430
DOI: 10.1155/2015/578541
author: Broderick Crawford
author: Ricardo L. Soto
author: Natalia Berríos
author: Franklin Johnson
author: Fernando Paredes
author: C. Castro
author: Enrique Norero
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6926691
describes a project that uses: Genocop
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/578541
OpenAlex ID: W1548305550
Wikidata QID: Q59119440
cites work: Q4873721
cites work: Q3979601
cites work: An indirect genetic algorithm for set covering problems
cites work: Algorithms for the set covering problem
cites work: Enhancing an algorithm for set covering problems
cites work: A network relaxation based enumeration algorithm for set partitioning
cites work: A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem
cites work: Using a facility location algorithm to solve large set covering problems
cites work: An Integer Programming Approach to the Vehicle Scheduling Problem
cites work: Multi-Commodity Disconnecting Sets
cites work: Set Covering and Involutory Bases
cites work: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
cites work: A Lagrangian-based heuristic for large-scale set covering problems
cites work: Simplification of the Covering Problem with Application to Boolean Expressions
cites work: Zero-one programming using non-binary tree-search
cites work: Optimal Political Districting by Implicit Enumeration Techniques
cites work: Q4735035
cites work: A hybrid heuristic for the set covering problem
Recommended article: Solving the non-unicost set covering problem by using cuckoo search and black hole optimization
Recommended article: Q4494414
Recommended article: Binary cockroach swarm optimization for combinatorial optimization problem
Recommended article: A new approach for solving set covering problem using jumping particle swarm optimization method
Recommended article: An application of swarm optimization to nonlinear programming
Recommended article: Q2987665
Recommended article: Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems
description: scientific article; zbMATH DE number 6926691