Yuet M. Lam and Wayne Luk
[1] Y.M. Lam, S.Y. Yu, and P. Wang, A parallel threads coordina-tion scheme for solving combinatorial optimization problems,Proceedings of the IEEE TENCON, 2013, 1–4. [2] T.G. Crainic, M. Toulouse, and M. Gendreau, Synchronoustabu search parallelization strategies for multicommoditylocation-allocation with balancing requirements, OR Spectrum,17(2–3), 1995, 113–123. [3] J.P. Cohoon, W.N. Martin, and D.S. Richards, Genetic al-gorithms and punctuated equilibra in vlsi, Parallel ProblemSolving from Nature, Lecture Notes in Computer Science, 496,1991, 134–144. [4] D. Whitley, S. Rana, and R.B. Heckendorn, Optimizationusing distributed genetic algorithms, Parallel Problem Solvingfrom Nature, Lecture Notes in Computer Science, 496, 1991,176–185. [5] T. Matsumura, M. Nakamura, D. Miyazato, K. Onaga, andJ. Okech, Effects of chromosome migration on a parallel anddistributed genetic algorithm, Proc. of the IEEE Int. Symp.on Parallel Architectures, Algorithms, and Networks, 1997,357–361. [6] S.A. Kravitz and R.A. Rutenbar, Placement by simulated an-nealing on a multiprocessor, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6(4), 1987,534–549. [7] I. Mavroidis, I. Papaefstathiou, and D. Pnevmatikatos, Hard-ware implementation of 2-Opt local search algorithm for thetraveling salesman problem, Proc. of the IEEE/IFIP Int.Workshop on Rapid System Prototyping, 2007, 41–47. [8] T.V. Luong, N. Melab, and E.-G. Talbi, GPU computing forparallel local search metaheuristic algorithms, IEEE Transac-tions on Computers, 62(1), 2013, 173–185. [9] C. Ababei, Speeding up FPGA placement via partitioningand multithreading, International Journal of ReconfigurableComputing, 2009, Article ID 514754. [10] W.H. Choi and X. Liu, Case study: GPU-based implementationof sequence pair based floorplanning using CUDA, Proc. of theInt. Symp. on Circuits and Systems, 2010, 917–920. [11] Y. Han, S. Roy, and K. Chakraborty, Optimizing simulatedannealing on GPU: A case study with IC floorplanning, Proc.of the Int. Symp. on Quality Electronic Design, 2011, 1–7. [12] M.A. O’Neil, D. Tamir, and M. Burtscher, A parallel GPUversion of the traveling salesman problem, Proc. of the Int.Conf. on Parallel and Distributed Processing Techniques andApplications, 2011, 348–353. [13] M. Burtscher and H. Rabeti, A scalable heterogeneous par-allelization framework for iterative local searches, Proc. ofthe IEEE Int. Parallel & Distributed Processing Symp., 2013,1289–1298. [14] J.J. Schneider and S. Kirkpatrick, Stochastic Optimization(Springer-Verlag, Berlin Heidelberg, 2006). [15] S. Lin, Computer solutions of the traveling salesman problem,Bell System Technical Journal, 44, 1965, 2245–2269. [16] Y.M. Lam, K.H. Tsoi, and W. Luk, Parallel neighbourhoodsearch on many-core platforms, International Journal of Com-putational Science and Engineering, 8(3), 2013, 281–293. [17] G. Reinelt, TSPLIB: A traveling salesman problem library,ORSA Journal on Computing, 3, 1991, 376–384. [18] R. Burkard, S. Karisch, and F. Rendl, QAPLIB – A quadraticassignment problem library, Journal of Global Optimization,10(4), 1997, 391–403. [19] A. Choong, R. Beidas, and J. Zhu, Parallelizing simulatedannealing-based placement using GPGPU, Proc. of the Int.Conf. on Field Programmable Logic and Applications, 2010,31–34. [20] T.V. Luong, L. Loukil, N. Melab, and E.-G. Talbi, AGPU-based iterated tabu search for solving the quadratic 3-dimensional assignment problem, Proc. of the Int. Conf. onComputer Systems and Applications, 2010, 1–8. [21] T.V. Luong, N. Melab, and E.-G. Talbi, Large neighborhoodlocal search optimization on graphics processing units, Proc.of the IEEE Int. Symp. on Parallel and Distributed Processing,2010, 1–8. [22] N. Fujimoto and S. Tsutsui, A highly-parallel TSP solverfor a GPU computing platform, Numerical Methods and Ap-plications, Lecture Notes in Computer Science, 6046, 2011,264–271.
Important Links:
Go Back
