An ant colony optimisation algorithm for the set packing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3172 LNCS, Issue , 2004, Pages 49-60

  Gandibleux, Xavier ^a   Delorme, Xavier ^a   T'Kindt, Vincent ^b  

^a UNIVERSITÉ DE VALENCIENNES   (France)

^b Laboratoire d'Informatique   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SWARM INTELLIGENCE; ALGORITHMS; ANT COLONY OPTIMIZATION; ARTIFICIAL INTELLIGENCE;

COMPUTATIONAL EXPERIMENT; CONSTRUCTION STRATEGIES; DISTURBANCE STRATEGIES; EXPLORATION AND EXPLOITATION; OPTIMAL SOLUTIONS; OPTIMISATION PROBLEMS; SEARCH PROCEDURES; SET PACKING PROBLEM;

ANT COLONY OPTIMIZATION; OPTIMIZATION;

EID: 77049087829     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_5     Document Type: Conference Paper

References (18)

1. X. Delorme. Modélisation et résolution de problèmes liés à l'exploitation d'infrastructures ferroviaires. PhD thesis, Université de Valenciennes, Valenciennes, France, 2003.
2. X. Delorme, X. Gandibleux, and J. Rodriguez. GRASP for set packing problems. European Journal of Operational Research, 153 (3):564-580, 2004.
3. X. Delorme, J. Rodriguez, and X. Gandibleux. Heuristics for railway infrastructure saturation. In L. Baresi, J-J. Lévy, R. Mayr, M. Pezzè, G. Taentzer, and C. Zaroliagis, editors, ICALP 2001, volume 50 of Electronic Notes in Theoretical Computer Science (URL: http://www.elsevier. nl/locate/entcs/volume50.html), pages 41-55. Elsevier Science, 2001.
4. M. Dorigo, G. Di Caro, and L.M. Gambardella. Ant algorithms for discrete optimization. Artificial Life, 5(3):137-172, 1999.
5. L.M. Gambardella, E. Taillard, and M. Dorigo. Ants colonies for the QAP. Journal of the Operational Research Society, 5:167-176, 1999.
6. M.R. Garey and D.S. Johnson. Computers and intractability : a guide to the theory of NP-Completeness. V.H. Freeman and Company, San Francisco, 1979.
7. S.-H. Kim and K.-K. Lee. An optimization-based decision support system for ship scheduling. Computers and Industrial Engineering, 33:689-692, 1997.
8. A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco. An exact algorithm for the project scheduling with ressource constraints based on a new mathematical formulation. Management Science, 44(5):714-729, mai 1998.
9. G.L. Nemhauser and L.A. Wolsey. Integer and combinatorial optimization. Willey-Interscience, New York, 1999.
10. I.H. Osman and G. Laporte. Metaheuristics : a bibliography. Annals of Operations Research, 63:513-623, 1996.
11. C. Paccou. L'algorithme des fourmis appliqué au Set Packing Problem. Master's thesis, Université de Valenciennes, Valenciennes, France, April 2002.
12. M.W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5:199-215, 1973.
13. M. R̈onnqvist. A method for the cutting stock problem with different qualities. European Journal of Operational Research, 83:57-68, 1995.
14. F. Rossi and S. Smriglio. A set packing model for the ground holding problem in congested networks. European Journal of Operational Research, 131:400-416, 2001.
15. T. Stützle. An ant approach for the flow shop problem. In Proceedings of EUFIT'98, Aachen (Germany), pages 1560-1564, 1998.
16. T. Stützle and M. Dorigo. ACO algorithms for the traveling salesman problem. in K. Miettinen, M. Makela, P. Neittaanmaki and J. Periaux (Eds.): Evolutionary Algorithms in Engineering and Computer Science: recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming Genetic Programming and Industrial Applications, John Wiley & Sons, pages 1560-1564, 1999.
17. V. T'kindt, N. Monmarché, F. Tercinet, and D. Laugt. An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem. European Journal of Operational Research, 142(2):250-257, 2002.
18. P.J. Zwaneveld, L.G. Kroon, H.E. Romeijn, M. Salomon, S. Dauz̀ere-Pérès, Stan P.M. Van Hoesel, and H.W. Ambergen. Routing trains through railway stations : Model formulation and algorithms. Transportation Science, 30(3):181-194, august 1996.