Ant colonies for the quadratic assignment problem. This paper presents HAS-QAP, a hybrid ant colony system coupled with a local search, applied to the quadratic assignment problem. HAS-QAP uses pheromone trail information to perform modifications on QAP solutions, unlike more traditional ant systems that use pheromone trail information to construct complete solutions. HAS-QAP is analysed and compared with some of the best heuristics available for the QAP: two versions of tabu search, namely, robust and reactive tabu search, hybrid genetic algorithm, and a simulated annealing method. Experimental results show that HAS-QAP and the hybrid genetic algorithm perform best on real world, irregular and structured problems due to their ability to find the structure of good solutions, while HAS-QAP performance is less competitive on random, regular and unstructured problems.

References in zbMATH (referenced in 37 articles , 1 standard article )

Showing results 1 to 20 of 37.
Sorted by year (citations)

1 2 next

  1. Chen, Gary Yu-Hsin: New variable-length data compression scheme for solution representation of meta-heuristics (2021)
  2. Zhao, Chunliang; Zhou, Yuren; Chen, Zefeng: Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem (2021)
  3. Bir-Jmel, Ahmed; Douiri, Sidi Mohamed; Elbernoussi, Souad: Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data (2019)
  4. Kuo, R. J.; Wibowo, B. S.; Zulvia, F. E.: Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time (2016)
  5. Hussin, Mohamed Saifullah; Stützle, Thomas: Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (2014)
  6. Nguyen, Thanh-Ha; Wright, Mike: Variable neighborhood search for the workload balancing problem in service enterprises (2014)
  7. Czapiński, Michał: An effective parallel multistart tabu search for quadratic assignment problem on CUDA platform (2013) ioport
  8. Misevicius, Alfonsas: An implementation of the iterated tabu search algorithm for the quadratic assignment problem (2012)
  9. Sharma, Vikas K.; Agarwal, Manju; Sen, Kanwar: Reliability evaluation and optimal design in heterogeneous multi-state series-parallel systems (2011) ioport
  10. Agarwal, Manju; Sharma, Vikas K.: Ant colony approach to constrained redundancy optimization in binary systems (2010)
  11. Zhang, Huizhen; Beltran-Royo, Cesar; Constantino, Miguel: Effective formulation reductions for the quadratic assignment problem (2010)
  12. Diab, Nadim; Smaili, Ahmad: Optimum exact/approximate point synthesis of planar mechanisms (2008)
  13. Donati, Alberto V.; Montemanni, Roberto; Casagrande, Norman; Rizzoli, Andrea E.; Gambardella, Luca M.: Time dependent vehicle routing problem with a multi ant colony system (2008)
  14. Drezner, Zvi: Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem (2008)
  15. Kong, Min; Tian, Peng; Kao, Yucheng: A new ant colony optimization algorithm for the multidimensional Knapsack problem (2008)
  16. Lim, Kwee Kim; Ong, Yew-Soon; Lim, Meng Hiot; Chen, Xianshun; Agarwal, Amit: Hybrid ant colony algorithms for path planning in sparse graphs (2008) ioport
  17. Randall, Marcus: Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (2008)
  18. Solnon, Christine: Combining two pheromone structures for solving the car sequencing problem with ant colony optimization (2008)
  19. Cheng, Chi-Bin; Mao, Chun-Pin: A modified ant colony system for solving the travelling salesman problem with time windows (2007)
  20. Liao, Ching-Jong; Juan, Hsiao-Chien: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups (2007)

1 2 next