An ant colony algorithm for the Quadratic Set Covering Problem

Masaeli, Mobina

doi:10.46254/AN05.20150167

Back

5th Annual International Conference on Industrial Engineering and Operations Management

An ant colony algorithm for the Quadratic Set Covering Problem

Download PDF

Mobina Masaeli

Publisher: IEOM Society International

2 Views

0 Downloads

Track: Operations Research

This paper develops an ant colony algorithm to solve the quadratic set covering problem. QSC is a combinatorial optimization problem. This problem, which arises in many applications, is an extension of set covering problem. We tune one of the algorithm’s parameters by statistical test and examine the quality of the algorithm with a set of instances. Computational results show that our algorithm is efficient for median size of problem with a low density.

Published in: 5th Annual International Conference on Industrial Engineering and Operations Management, Dubai, United Arab Emirates

Publisher: IEOM Society International
Date of Conference: March 3 -5 , 2015

ISBN: 978-0-9855497-2-5
ISSN/E-ISSN: 2169-8767

Related Research

Critical Factors of Supplier Selection in the Food and Beverage Industry of Saudi Arabia A Fuzzy-TOPSIS Approach

11th Annual International Conference on Industrial Engineering and Operations Management

Published: 2021

Event of Crime against Property: Robbery & Theft Prediction using Probabilistic Graphical Model

10th Annual International Conference on Industrial Engineering and Operations Management

Published: 2020

Model for Locating Hospitals in a City

5th European International Conference on Industrial Engineering and Operations Management

Published: 2022