A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem

  • Mutsunori Yagiura
  • Akira Komiya
  • Kenya Kojima
  • Koji Nonobe
  • Hiroshi Nagamochi
  • Toshihide Ibaraki
  • Fred Glover
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4638)


We consider the multi-resource generalized quadratic assignment problem (MR-GQAP), which has many applications in various fields such as production scheduling, and constitutes a natural generalization of the generalized quadratic assignment problem (GQAP) and the multi-resource generalized assignment problem (MRGAP). We propose a new algorithm PR-CS for this problem that proves highly effective. PR-CS features a path relinking approach, which is a mechanism for generating new solutions by combining two or more reference solutions. It also features an ejection chain approach, which is embedded in a neighborhood construction to create more complex and powerful moves. Computational comparisons on benchmark instances show that PR-CS is more effective than existing algorithms for GQAP, and is competitive with existing methods for MRGAP, demonstrating the power of PR-CS for handling these special instances of MR-GQAP without incorporating special tailoring to exploit these instances.


Local Search Assignment Problem Constraint Satisfaction Problem Benchmark Instance Quadratic Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cordeau, J., Gaudioso, M., Laporte, G., Moccia, L.: A memetic heuristic for the generalized quadratic assignment problem. INFORMS Journal on Computing 18, 433–443 (2006)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Gavish, B., Pirkul, H.: Algorithms for the multi-resource generalized assignment problem. Management Science 37, 695–713 (1991)zbMATHCrossRefGoogle Scholar
  3. 3.
    Glover, F.: Genetic algorithms and scatter search: unsuspected potentials. Statistics and Computing 4, 131–140 (1994)CrossRefGoogle Scholar
  4. 4.
    Glover, F.: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms. Discrete Applied Mathematics 49, 231–255 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems, Research Report, University of Colorado, Boulder, CO. Discrete Applied Mathematics 65, 223–253 (1996)Google Scholar
  6. 6.
    Ibaraki, T., Ohashi, T., Mine, H.: A heuristic algorithm for mixed-integer programming problems. Mathematical Programming Study 2, 115–136 (1974)Google Scholar
  7. 7.
    Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, Boston (2003)Google Scholar
  8. 8.
    Lee, C., Ma, Z.: The generalized quadratic assignment problem, Technical Report. Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario, Canada (2003)Google Scholar
  9. 9.
    Martí, R., Laguna, M., Glover, F.: Principles of scatter search. European Journal of Operational Research 169, 359–372 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Nonobe, K., Ibaraki, T.: A tabu search approach to the CSP (constraint satisfaction problem) as a general problem solver. European Journal of Operational Research 106, 599–623 (1998)zbMATHCrossRefGoogle Scholar
  11. 11.
    Voss, S.: Heuristics for nonlinear assignment problems. In: Pardalos, P.M., Pitsoulis, L.S. (eds.) Nonlinear Assignment Problems, pp. 175–215. Kluwer Academic Publishers, Dordrecht (2000)Google Scholar
  12. 12.
    Yagiura, M., Ibaraki, T., Glover, F.: An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing 16, 133–151 (2004)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Yagiura, M., Iwasaki, S., Ibaraki, T., Glover, F.: A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization 1, 87–98 (2004)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Mutsunori Yagiura
    • 1
  • Akira Komiya
    • 2
  • Kenya Kojima
    • 2
  • Koji Nonobe
    • 3
  • Hiroshi Nagamochi
    • 2
  • Toshihide Ibaraki
    • 4
  • Fred Glover
    • 5
  1. 1.Graduate School of Information Science, Nagoya University, NagoyaJapan
  2. 2.Graduate School of Informatics, Kyoto University, KyotoJapan
  3. 3.Faculty of Engineering and Design, Hosei University, TokyoJapan
  4. 4.School of Science and Technology, Kwansei Gakuin University, SandaJapan
  5. 5.Leeds School of Business, University of Colorado, Boulder, COUSA

Personalised recommendations