Parallel simulated annealing for the set-partitioning problem

Proceedings - 8th Euromicro Workshop on Parallel and Distributed Processing, EURO-PDP 2000

Volumn , Issue , 2000, Pages 343-350

  Czech, Z J ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Delivery problem; heuristic algorithms; parallel algorithms; parallel simulated annealing; set partitioning problem

Indexed keywords

HEURISTIC ALGORITHMS; PARALLEL ALGORITHMS; SIMULATED ANNEALING;

DELIVERY PROBLEMS; NP COMPLETE; PARALLEL SIMULATED ANNEALING; PARALLEL SIMULATED ANNEALING ALGORITHM; QUALITY OF SOLUTION; SET PARTITIONING PROBLEM;

PROBLEM SOLVING;

EID: 3142696812     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2000.823429     Document Type: Conference Paper

References (17)

1. E. H. L. Aarts and J. H. M. Korst. Simulated Annealing and Boltzmann Machines. J. Wiley, Chichester, 1989.
2. E. H. L. Aarts and P. J. M. van Laarhoven. Simulated Annealing: Theory and Applications. J. Wiley, New York, 1987.
3. R. Azencott. Parallel simulated annealing: An overview of basic techniques. In R. Azencott, editor, Simulated annealing. Parallelization Techniques, pages 37-46. J. Wiley, New York, 1992.
4. R. Azencott and C. Graffigne. Parallel annealing by periodically interacting multiple searches: Acceleration rates. In R. Azencott, editor, Simulated Annealing. Parallelization Techniques, pages 81-90. J. Wiley, New York, 1992.
5. N. Boissin and J. L. Lutton. A parallel simulated annealing algorithm. Parallel Computing, 19:859-872, 1993.
6. S. Cichoński. An application of simulated annealing to the set-partitioning problem. Technical report, Silesia University of Technology, 1998. (in print).
7. V. Cěrny. A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J. of Optimization Theory and Applic., 45:41-55, 1985.
8. F. Glover and M. Laguna. Tabu search. In C. R. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems, pages 70-150. McGraw-Hill, London, 1995.
9. C. Graffigne. Parallel annealing by periodically interacting multiple searches: An experimental study. In R. Azencott, editor, Simulated Annealing. Parallelization Techniques, pages 47-79. J. Wiley, New York, 1992.
10. D. R. Greening. Parallel simulated annealing techniques. Physica D, 42:293-306, 1990.
11. S. Kirkpatrick, C. D. Gellat, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
12. R. Korf. Optimal path-finding algorithms. In L. Kanal and V. Kumar, editors, Search in Artificial Intelligence, pages 223-267. Springer-Verlag, 1988.
13. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculation by fast computing machines. Journ. of Chem. Phys., 21:1087-1091, 1953.
14. J. Pearl. Heuristics. Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, Mass., 1984.
15. C. R. Reeves, editor. Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill, London, 1995.
16. M. M. Syslo, N. Deo, and J. S. Kowalik. Discrete optimization algorithms with Pascal programs. Prentice-Hall, 1983.
17. M. G. A. Verhoeven and E. H. L. Aarts. Parallel local search techniques. Journal of Heuristics, 1:43-65, 1996.