The research work on local search algorithms solving Quadratic Assignment Problem

references:

• Iterated local search for the quadratic assignment problem
  
• ITERATED LOCAL SEARCH
  
• GUIDED LOCAL SEARCH and here

best known results for tai benchmarks:

• see Page 6. TABLE IX

• Best known solution cost: 703482
  
• Initial solution cost: 873908
  
• Local Search optimal cost 747858 ( exec time 0.06 seconds)
• Iterated Local Search optimal cost 742752 ( exec time 2.92 seconds)
• Guided Local Search optimal cost 717222 ( exec time 0.65 seconds)

• Best known solution cost: 3139370
  
• Initial solution cost: 3853396
  
• Local Search optimal cost 3481496 ( exec time 0.16 seconds)
• Iterated Local Search optimal cost 3361050 ( exec time 12.22 seconds)
• Guided Local Search optimal cost 3325712 ( exec time 1.46 seconds)

• Best known solution cost: 7205962
  
• Initial solution cost: 8484364
  
• Local Search optimal cost 7959112 ( exec time 0.64 seconds)
• Iterated Local Search optimal cost 7754148 ( exec time 22.11 seconds)
• Guided Local Search optimal cost 7656154 ( exec time 3.82 seconds)

• Best known solution cost: 13515450
  
• Initial solution cost: 15707292
  
• Local Search optimal cost 14924312 ( exec time 0.78 seconds)
• Iterated Local Search optimal cost 14773828 ( exec time 36.07 seconds)
• Guided Local Search optimal cost 14460422 ( exec time 8.67 seconds)

• Best known solution cost: 21054656
  
• Initial solution cost: 24149696
  
• Local Search optimal cost 23556992 ( exec time 0.33 seconds)
• Iterated Local Search optimal cost 23037370 ( exec time 51.95 seconds)
• Guided Local Search optimal cost 22139380 ( exec time 20.34 seconds)