Daftar Isi:
  • The quadratic assigment problem (QAP) is one of the most interesting and most challenging combinatorial optimization problems in existence. In this paper we propose a random point strategy to get a starting point, and then we use a combination methods to get ̳optimal‘ solution. As a computational experience we‘ve solved QAP 30 x 30 adopted from Nugent and backboard wiring problem 42  42, adopted from Skorin-Kapov.