Parallel simulated annealing for solving the room assignment problem on shared and distributed memory platforms

Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, CompSysTech'08

Volumn , Issue , 2008, Pages

  Lazarova, Milena ^a  

^a TECHNICAL UNIVERSITY OF SOFIA   (Bulgaria)

Author keywords

Message passing; Multithreading; Parallel simulated annealing; Profiling; Solution quality; Speedup; Synchronous and asynchronous moves

Indexed keywords

MULTITHREADING; PARALLEL SIMULATED ANNEALING; PROFILING; SOLUTION QUALITY; SPEEDUP; SYNCHRONOUS AND ASYNCHRONOUS MOVES;

ANNEALING; COMPUTER SCIENCE; MESSAGE PASSING; TRAVELING SALESMAN PROBLEM;

SIMULATED ANNEALING;

EID: 70349130253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1500879.1500900     Document Type: Conference Paper

References (15)

1. Aarts, E., F. de Bont, J. Habers, P. van Laarhoven, A parallel statistical cooling algorithm. Proc. of the 3rd Annual Symposium on Theoretical Aspects of Computer Science, LNCS Series, Vol. 210, 1986, pp. 87-97.
2. Aarts, E., J. Korst, P. van Laarhoven. Simulated annealing. In E. Aarts, J. Lenstra (edts.), Local Search in Combinatorial Optimization, Wiley, 1997, pp. 91-120.
3. Chapman, B., G. Jost, R. van der Pas, Using OpenMP: Portable Shared Memory Parallel Programming, MIT Press, 2007.
4. Dréo, J., A. Pétrowski, P. Siarry, E. Taillard. Metaheuristics for Hard Optimization, Springer-Verlag, Berlin, 2006.
5. Durand, M., S. White, Trading Accuracy for Speed in Parallel Simulated Annealing with Simultaneous Moves, Parallel Computing, Vol. 26, No1, January 2000, pp. 135-150.
6. Kirkpatrick S., C. Gelatt, M. Vecchi, Optimization by Simulated Annealing, Science, Vol. 220, No 4598, 1983, pp. 671-680.
7. Lee S., K. Lee, Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains, IEEE Trans. on Parallel Distributed Systems, Vol. 7, No 10, 1996, pp. 993-1008.
8. Martinez-Alfaro, H., J. Minero, G. Alanis, N. Leal, I. Avila, Using Simulated Annealing to Solve the Classroom Assignment Problem, Proc. of Int. Conf. on Intelligent Systems Technologies (ISAI/IFIS), 1996, pp. 370-377.
9. Matsumoto, M., T. Nishimura, Mersenne Twister: A 623-dimensionally Equidistributed Uniform Pseudorandom Number Generator, ACM Trans. on Modeling and Computer Simulation, Vol. 8, No 1, 1998, pp. 3-30.
10. Metropolis N., A. Rosenbluth, M. Rosenbluth, A. Teller, E. Teller, Equation of State Calculations by Fast Computing Machines, Journal of Chemical Physics, Vol. 21, 1953, pp. 1087-1092.
11. Quinn M., Parallel Programming in C with MPI and OpenMP, McGraw Hill, 2003.
12. Rabenseifner R., G. Hager, G. Jost, R. Keller, The Hybrid MPI and OpenMP Parallel Programming, LNCS Series: Recent Advances in Parallel Virtual Machine and Message Passing Interface, Springler-Verlag, Vol. 4192, 2006.
13. Ram, D., T. Sreenivas, K. Subramaniam, Parallel Simulated Annealing Algorithms, Journal of Parallel and Distributed Computing, Vol. 37, 1996, pp. 207-212.
14. Resende, M., P. Pardalos, S. Ekşioǧlu, Parallel Metaheuristics for Combinatorial Optimization, in R. Correa et al. (edts,), Models for Parallel and Distributed Computation - Theory, Algorithmic Techniques and Applications, Kluwer Academic Publishers, 2002, pp. 179-206.
15. Roussel-Ragot, P., P. Siarry, G. Dreyfus, A Problem Independent Parallel Implementation of Simulated Annealing: Models and Experiments. IEEE Trans. CADICS, Vol. 9, 1990, pp. 827-835.