GRASP bibliography: Hybridization

  1. Parallel GRASP with path-relinking for job shop scheduling

    R.M. Aiex, S. Binato, and M.G.C. Resende

    Parallel Computing, 29:393-430, 2003.

  2. Scatter search for a network design problem

    A.M. Álvarez, J. L. González, and K. De-Alba

    Technical Report PISIS-2003-02, Universidad Autónoma de Nuevo León, Facultad de Ingeniería Mecánica y Eléctrica, División de Posgrado en Ingeniería de Sistemas, Mexico., 2003.

  3. Tabu search based heuristics for multi-floor facility layout

    S. Abdinnour-Helm and S.W. Hadley

    International Journal of Production Research, 38:365-383, 2000.

  4. Generating short-term observations for space mission projects

    M.S. Akturk and K. Kiliç

    J. of Intelligent Manufacturing, 10:387-404, 1999.

  5. Greedy random adaptive memory programming search for the capacitated clustering problem

    S. Ahmadi and I.H. Osman

    European Journal of Operational Research, 2003, To appear.

  6. A greedy genetic algorithm for the quadratic assignment problem

    R.K. Ahuja, J.B. Orlin, and A. Tiwari

    Computers and Operations Research, 27:917-934, 2000.

  7. Parallel strategies for GRASP with path-relinking

    R.M. Aiex and M.G.C. Resende

    Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2003.

  8. Motif-GRASP and Motif-ILS: Two new stochastic local search algorithms for motif finding

    M. Andronescu and B. Rastegari

    Technical report, Computer Science Department, University of British Columbia, Vancouver, Canada, 2003.

  9. GRASP with path relinking for the three-index assignment problem

    R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo

    Technical report, AT&T Labs Research, Florham Park, NJ 07733, 2000. To appear in INFORMS J. on Computing.

  10. Efficient hybrid search techniques for circuit partitioning

    S. Areibi and A. Vannelli

    In IEEE 4th World Multiconference on Circuits, Systems, Communications & Computers, July 2000.

  11. A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems

    R. Alvarez-Valdés, A. Parajón, and J.M. Tamarit

    Computers & Operations Research, 29:925-947, 2002.

  12. A branch-and-cut procedure for the vehicle routing problem with time windows

    J.F. Bard, G. Kontoravdis, and G. Yu

    Transportation Science, 36:250-269, 2002.

  13. A GRASP interactive approach to the vehicle routing problem with backhauls

    C. Carreto and B. Baker

    In C.C. Ribeiro and P. Hansen, editors, Essays and surveys in metaheuristics, pages 185-200. Kluwer Academic Publishers, 2002.

  14. A GRASP algorithm for clustering

    J.R. Cano, O. Cordón, F. Herrera, and L. Sánchez

    In F. J. Garijo, J.C.R. Santos, and M. Toro, editors, Advances in Artificial Intelligence - IBERAMIA 2002, 8th Ibero-American Conference on AI, Seville, Spain, November 12-15, 2002, Proceedings, volume 2527 of Lecture Notes in Computer Science, pages 214-223. Springer, 2002.

  15. Métodos de reinício aplicados ao seqüenciamento em uma máquina com tempos de preparac cão e data de entrega

    L.M. Christofoletti

    Master's thesis, Departamento de Engenharia de Sistemas, Universidade Estadual de Campinas, Brazil, April 2002.

  16. Local search with perturbation for the prize-collecting Steiner tree problems in graphs

    S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro

    Networks, 38:50-58, 2001.

  17. Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem

    H. Delmaire, J.A. Díaz, E. Fernández, and M. Ortega

    INFOR, 37:194-225, 1999.

  18. A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy

    M.C. de Souza, C. Duhamel, and C.C. Ribeiro

    In M.G.C. Resende and J.P. de Sousa, editors, Metaheuristics: Computer decision-making, pages 627-658. Kluwer Academic Publishers, 2003.

  19. Power transmission network design by greedy randomized adaptive path relinking

    H. Faria Jr., S. Binato, M.G.C. Resende, and D.M. Falc ao

    IEEE Transactions on Power Systems, 2004, To appear.

  20. Randomized heuristics for the MAX-CUT problem

    P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro

    Optimization Methods and Software, 7:1033-1058, 2002.

  21. GRASP and path relinking for 2-layer straight line crossing minimization

    M. Laguna and R. Martí

    INFORMS Journal on Computing, 11:44-52, 1999.

  22. Expading neighborhood GRASP for the Traveling Salesman Problem

    Y. Marinakis and A. Migdalas

    Technical report, Technical University of Crete, Chania 73100, Greece, 2003.

  23. A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy

    S.L. Martins, M.G.C. Resende, C.C. Ribeiro, and P.M. Pardalos

    Journal of Global Optimization, 17:267-283, 2000.

  24. GRASP with path-relinking for the QAP

    C.A. Oliveira, P.M. Pardalos, and M.G.C. Resende

    In T. Ibaraki and Y. Yoshitomi, editors, Proceedings of the Fifth Metaheuristics International Conference (MIC2003), pages 57-1 -- 57-6, 2003.

  25. GRASP and path relinking for the matrix bandwidth minimization

    E. Piñana, I. Plana, V. Campos, and R. Martí

    European J. of Operational Research, 153(1):200-210, 2004.

  26. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment

    M. Prais and C.C. Ribeiro

    INFORMS Journal on Computing, 12:164-176, 2000.

  27. Implementation of a variance reduction based lower bound in a branch and bound algorithm for the quadratic assignment problem

    P.M. Pardalos, K.G. Ramakrishnan, M.G.C. Resende, and Y. Li

    SIAM Journal on Optimization, 7:280-294, 1997.

  28. GRASP implementations for the unconstrained binary quadratic optimization problem

    G. Palubeckis and A. Tomkevicius

    Information Technology and Control, 24:14-20, 2002.

  29. Design of hybrids for the minimum sum-of-squares clustering problem

    J. Pacheco and O. Valencia

    Computational Statistics and Data Analysis, 43:235-248, 2003.

  30. GRASP and path-relinking: Recent advances and applications

    M.G.C. Resende and C.C. Ribeiro

    In T. Ibaraki and Y. Yoshitomi, editors, Proceedings of the Fifth Metaheuristics International Conference (MIC2003), pages T6-1 -- T6-6, 2003.

  31. GRASP and path-relinking: Recent advances and applications

    M.G.C. Resende and C.C. Ribeiro

    Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2003.

  32. GRASP with path-relinking for private virtual circuit routing

    M.G.C. Resende and C.C. Ribeiro

    Networks, 41:104-114, 2003.

  33. A hybrid GRASP with perturbations for the Steiner problem in graphs

    C.C. Ribeiro, E. Uchoa, and R.F. Werneck

    INFORMS Journal on Computing, 14:228-246, 2002.

  34. A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure

    C.C. Ribeiro and D.S. Vianna

    Technical report, Department of Computer Science, Catholic U. of Rio de Janeiro, Rio de Janeiro, Brazil, 2003.

  35. A hybrid multistart heuristic for the uncapacitated facility location problem

    M.G.C. Resende and R.F. Werneck

    Technical report, Internet and Network Systems Research Center, AT&T Labs Research, Florham Park, NJ, 2003. Submitted to European J. of Operational Research.

  36. A hybrid heuristic for the p-median problem

    M.G.C. Resende and R.F. Werneck

    Journal of Heuristics, 10:59-88, 2004.

  37. A GRASP-tabu search algorithm for school timetabling problems

    M.J.F. Souza, N. Maculan, and L.S. Ochi

    In M.G.C. Resende and J.P. de Sousa, editors, Metaheuristics: Computer decision-making, pages 659-672. Kluwer Academic Publishers, 2003.