GRASP for set packing problems

European Journal of Operational Research

Volumn 153, Issue 3 SPEC. ISS., 2003, Pages 564-580

  Delorme, Xavier ^a,b   Gandibleux, Xavier ^b   Rodriguez, Joaquin ^a  

^a UNIVERSITÉ GUSTAVE EIFFEL   (France)

^b LAMIH   (France)

Author keywords

Combinatorial optimization; Metaheuristic; Path relinking; Railway planning problem; Reactive GRASP; Set packing problem

Indexed keywords

HEURISTIC METHODS; OPTIMIZATION; SET THEORY;

SET PACKING PROBLEM;

OPERATIONS RESEARCH;

EID: 0242490109     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00263-7     Document Type: Conference Paper

References (26)

1. M. Gondran, M. Minoux, Graphes et algorithmes, Eyrolles, 1995 (in French).
2. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. 1999;Wiley-Interscience.
3. X. Delorme, X. Gandibleux, J. Rodriguez, Application de la métaheuristique GRASP à la résolution d'un problème de capacité d'infrastructure ferroviaire, FRANCORO III, International Conference, May 9-12, 2001, Québec, Canada.
4. X. Delorme, J. Rodriguez, X. Gandibleux, Heuristics for railway infrastructure saturation, in: ATMOS 2001 (Satellite Workshops of the 28th International Colloquium on Automata, Languages, and Programming, ICALP) Proceedings, Electronic Notes in Theoretical Computer Science, vol. 50, Elsevier Science, 2001, pp. 41-55. Available from 〈http://www.elsevier.nl/locate/entcs/volume50.html〉.
5. Using the CPLEX callable library (user's guide), version 4.0, CPLEX optimization, 1995.
6. Féo T.A., Resende M.G. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters. 8:1989;67-71.
7. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;V.H. Freeman and Company.
8. Padberg M.W. On the facial structure of set packing polyhedra. Mathematical Programming. 5:1973;199-215.
9. Osman I., Laporte G. Metaheuristics: A bibliography. Annals of Operations Research. 63:1996;513-623.
10. Rönnqvist M. A method for the cutting stock problem with different qualities. European Journal of Operational Research. 83:1995;57-68.
11. Zwaneveld P.J., Kroon L.G., Romeijn H.E., Salomon M., Dauzère-Pérès S., Van Hoesel S.P., Ambergen H.W. Routing trains through railway stations: Model formulation and algorithms. Transportation Science. 30(3):1996;181-194.
12. Kim S.-H., Lee K.-K. An optimization-based decision support system for ship scheduling. Computers and Industrial Engineering. 33:1997;689-692.
13. Mingozzi A., Maniezzo V., Ricciardelli S., Bianco L. An exact algorithm for the project scheduling with resource constraints based on a new mathematical formulation. Management Science. 44(5):1998;714-729.
14. Rossi F., Smriglio S. A set packing model for the ground holding problem in congested networks. European Journal of Operational Research. 131:2001;400-416.
15. Pitsoulis L.S., Resende M.G. Greedy randomized adaptive search procedures. Pardalos P., Resende M. Handbook of Applied Optimization. 2002;168-183 Oxford University Press.
16. Resende M.G., Ribeiro C.C. Greedy randomized adaptive search procedures. Glover F., Kochenberger G. Handbook in Metaheuristics. 2002;219-249 Kluwer Academic Publishers.
17. Festa P., Resende M.G. GRASP: An annotated bibliography. Ribeiro C.C., Hansen P. Essays and Surveys on Metaheuristics. 2001;325-367 Kluwer Academic Publishers.
18. X. Delorme, Optimisation combinatoire et problèmes de capacité d'infrastructure ferroviaire, Mémoire de DEA, Université de Valenciennes et du Hainaut Cambrésis, Valenciennes, France, 2000 (in French).
19. Féo T.A., Resende M.G. Greedy randomized adaptative search procedures. Journal of Global Optimization. 6:1995;109-133.
20. X. Gandibleux, D. Vancoppenolle, D. Tuyttens, A first making use of GRASP for solving MOCO problems, 14th International Conference in Multiple Criteria Decision-Making, June 8-12, 1998, Charlottesville, USA.
21. D. Vancoppenolle, Résolution par GRASP de problèmes d'optimisation combinatoire, Mémoire de 2ème licence en informatique, Université de Mons-Hainaut, Mons, Belgique, 1998 (in French).
22. Féo T.A., Resende M.G., Smith S.H. A greedy randomized adaptative search procedure for maximum independent set. Operations Research. 42:1994;860-878.
23. Prais M., Ribeiro C.C. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing. 12:2000;164-176.
24. Glover F., Laguna M. Tabu Search. 1997;Kluwer Academic Publishers.
25. Laguna M., Martí R. Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing. 11:1999;44-52.
26. M.G. Resende, C.C. Ribeiro, A GRASP with path relinking for permanent virtual circuit routing, Tech. rep., AT&T Labs Research, 2001.