SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration

International Journal of Production Research

Volumn 48, Issue 4, 2010, Pages 1035-1047

  Zhu, Weihang ^a   Curry, James ^a   Marquez, Alberto ^a  

^a Lamar University   (United States)

Author keywords

Desktop parallel computing; Graphics hardware acceleration; Quadratic assignment problem; SIMD; Tabu search

Indexed keywords

COMBINATORIAL OPTIMISATION; GRAPHIC HARDWARE; GRAPHICS HARDWARE ACCELERATION; GRAPHICS PROCESSING UNIT; PARALLEL COMPUTING; QUADRATIC ASSIGNMENT PROBLEM; QUADRATIC ASSIGNMENT PROBLEMS; SINGLE INSTRUCTION MULTIPLE DATA;

ACCELERATION; CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTER HARDWARE; HARDWARE; PARALLEL ARCHITECTURES; PERSONAL COMPUTERS; PROGRAM PROCESSORS; TRAVELING SALESMAN PROBLEM;

TABU SEARCH;

EID: 74549219414     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540802555744     Document Type: Article

References (25)

1. Ahuja, R., Orlin, J., and Ashish, T., 2000. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research, 27 (10), 917-924.
2. Askin, R. and Standridge, C., 1995. Modeling and analysis of manufacturing systems. New York: John Wiley & Sons.
3. Bartolomei-Suarez, S.M. and Egbelu, P.J., 2000. Quadratic assignment problem QAP with adaptable material handling devices. International Journal of Production Research, 38 (4), 855-873.
4. Burkard, R.E., Karisch, S.E., and Rendl, F., 1997. QAPLIB - a quadratic assignment problem library. Journal of Global Optimization, 10 (4), 391-403.
5. Chaing, W.-C. and Kouvelis, P., 1996. An improved tabu search heuristic for solving facility layout design problems. International Journal of Production Research, 34 (9), 2565-2585.
6. Chakrapani, J. and Skorin-Kapov, J., 1993. Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research, 41 (4), 327-341.
7. de Carvalho Jr., S.A. and Rahmann, S., 2006. Microarray layout as a quadratic assignment problem. In: Proceedings of the German conference on bioinformatics, 20-22 September Tübingen, Germany, 11-20.
8. Drezner, Z., 2003. A new genetic algorithm for the quadratic assignment problem. Informs Journal on Computing, 15 (3), 320-330.
9. Drezner, Z., 2008. Extensive experiments with hybrid genetic algorithms for solutions of the quadratic assignment problem. Computers and Operations Research, 35 (3), 717-736.
10. Glover, F., 1989. Tabu search - part 1. ORSA Journal on Computing, 1 (3), 190-206.
11. Glover, F., 1990. Tabu search - part 2. ORSA Journal on Computing, 2 (1), 4-32.
12. Hani, Y., et al., 2007. Ant colony optimization for solving an industrial layout problem. European Journal of Operational Research, 183 (2), 633-642.
13. James, T., Rego, C., and Glover, F., 2005. Sequential and parallel path-relinking algorithms for the quadratic assignment problem. IEEE Intelligent Systems, 20 (4), 58-65.
14. James, T., Rego, C., and Glover, F., 2007. A cooperative parallel tabu search algorithm for the quadratic assignment problem. European Journal of Operational Research, doi:10.1016/j.ejor.2007.06.061. [In press].
15. Loiola, E.M., et al., 2007. A survey for the quadratic assignment problem. European Journal of Operational Research, 176 (2), 657-690.
16. Maniezzo, V., Dorigo, M., and Colorni, A., 1995. Algodesk: an experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem. European Journal of Operational Research, 81 (1), 188-204.
17. Nguyen, H., 2007. GPU gems 3. New York: Addison-Wesley.
18. nVidia 2007. CUDA programming guide version 1.1. Available from: http://developer.nvidia.com/object/cuda.html [Accessed 26 April 2008].
19. Pour, H.D. and Nosraty, M., 2006. Solving the facility and layout and location problem by ant-colony optimization-meta heuristic. International Journal of Production Research, 44 (23), 5187-5196.
20. Ramkumar, A.S., et al., 2008. Iterated fast local search algorithm for solving quadratic assignment
21. problems. Robotics and Computer-Integrated Manufacturing, 24 (3), 392-401.
22. Talbi, E.-G. and Bachelet, V., 2006. COSEARCH: a parallel cooperative metaheuristic. Journal of Mathematical Modeling and Algorithms, 5 (1), 5-22.
23. Taillard, E., 1991. Robust tabu search for the quadratic assignment problem. Parallel Computing, 17 (3-4), 443-455.
24. Taillard, E., 2005. Comparison of iterative searches for the quadratic assignment problem. Location Science, 3 (2), 87-105.
25. Wilhelm, M.R. and Ward, T.L., 1987. Solving quadratic assignment problems by simulated annealing. IIE Transactions, 19 (1), 107-119.