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.
Track: Operations Research
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