Abstract
In this paper we consider the application of an Ant Colony Optimisation (ACO) metaheuristic on the Set Packing Problem (SPP) which is a NP-hard optimisation problem. For the proposed algorithm, two solution construction strategies based on exploration and exploitation of solution space are designed. The main difference between both strategies concerns the use of pheromones during the solution construction. The selection of one strategy is driven automatically by the search process. A territory disturbance strategy is integrated in the algorithm and is triggered when the convergence of the ACO stagnates. A set of randomly generated numerical instances, involving from 100 to 1000 variables and 100 to 5000 constraints, was used to perform computational experiments. To the best of our knowledge, only one other metaheuristic (Greedy Randomized Adaptative Search Procedure, GRASP) has been previously applied to the SPP. Consequently, we report and discuss the effectiveness of ACO when compared to the best known solutions and including those provided by GRASP. Optimal solutions obtained with Cplex on the smaller instances (up to 200 variables) are indicated with the calculation times. These experiments show that our ACO heuristic outperforms the GRASP heuristic. It is remarkable that the ACO heuristic is made up of simple search techniques whilst the considered GRASP heuristic is more evolved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Delorme, X.: Modélisation et résolution de problèmes liés à l’exploitation d’infrastructures ferroviaires. PhD thesis, Université de Valenciennes, Valenciennes, France (2003)
Delorme, X., Gandibleux, X., Rodriguez, J.: GRASP for set packing problems. European Journal of Operational Research 153(3), 564–580 (2004)
Delorme, X., Rodriguez, J., Gandibleux, X.: Heuristics for railway infrastructure saturation. In: Baresi, L., Lévy, J.-J., Mayr, R., Pezzè, M., Taentzer, G., Zaroliagis, C. (eds.) ICALP 2001. Electronic Notes in Theoretical Computer Science, vol. 50, pp. 41–55. Elsevier Science, Amsterdam (2001), http://www.elsevier.nl/locate/entcs/volume50.html
Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5(3), 137–172 (1999)
Gambardella, L.M., Taillard, E., Dorigo, M.: Ants colonies for the QAP. Journal of the Operational Research Society 5, 167–176 (1999)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-Completeness. V.H. Freeman and Company, San Francisco (1979)
Kim, S.-H., Lee, K.-K.: An optimization-based decision support system for ship scheduling. Computers and Industrial Engineering 33, 689–692 (1997)
Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the project scheduling with ressource constraints based on a new mathematical formulation. Management Science 44(5), 714–729 (1998)
Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Willey-Interscience, New York (1999)
Osman, I.H., Laporte, G.: Metaheuristics: a bibliography. Annals of Operations Research 63, 513–623 (1996)
Paccou, C.: L’algorithme des fourmis appliqué au Set Packing Problem. Master’s thesis, Université de Valenciennes, Valenciennes, France (April 2002)
Padberg, M.W.: On the facial structure of set packing polyhedra. Mathematical Programming 5, 199–215 (1973)
Rönnqvist, M.: A method for the cutting stock problem with different qualities. European Journal of Operational Research 83, 57–68 (1995)
Rossi, F., Smriglio, S.: A set packing model for the ground holding problem in congested networks. European Journal of Operational Research 131, 400–416 (2001)
Stützle, T.: An ant approach for the flow shop problem. In: Proceedings of EUFIT 1998, Aachen (Germany), pp. 1560–1564 (1998)
Stützle, T., Dorigo, M.: ACO algorithms for the traveling salesman problem. In: Miettinen, K., Makela, M., Neittaanmaki, P., Periaux, J. (eds.) Evolutionary Algorithms in Engineering and Computer Science: recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming Genetic Programming and Industrial Applications, pp. 1560–1564. John Wiley & Sons, Chichester (1999)
T’kindt, V., Monmarché, N., Tercinet, F., Laugt, D.: An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research 142(2), 250–257 (2002)
Zwaneveld, P.J., Kroon, L.G., Romeijn, H.E., Salomon, M., Dauzère-Pérès, S., Hoesel, S.P.M.V., Ambergen, H.W.: Routing trains through railway stations: Model formulation and algorithms. Transportation Science 30(3), 181–194 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gandibleux, X., Delorme, X., T’Kindt, V. (2004). An Ant Colony Optimisation Algorithm for the Set Packing Problem. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2004. Lecture Notes in Computer Science, vol 3172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28646-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-28646-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22672-7
Online ISBN: 978-3-540-28646-2
eBook Packages: Springer Book Archive