Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism

European Journal of Operational Research

Volumn 118, Issue 1, 1999, Pages 81-94

  Tian, Peng ^a,b   Ma, Jian ^a   Zhang, Dong Mo ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING; SIMULATED ANNEALING; STATISTICAL METHODS;

COMBINATORIAL OPTIMIZATIONS; PERMUTATION PROPERTIES; SIMULATED ANNEALING ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 0032688343     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00308-7     Document Type: Article

References (20)

1. E. Aarts, J. Korst, Simulated Annealing and Boltzmann Machine, John Wiley & Sons, New York, 1989.
2. M. Akgul, H.W. Hamacher, S. Tufekci (Eds.), Combinatorial Optimisation: New Frontiers in Theory and Practice, Springer-Verlag, Berlin, 1992.
3. A. Bolte, U.W. Thonemann, Optimisation simulated annealing schedules with genetic programming, European Journal of Operational Research 92 (1996) 402-416.
4. R.E. Burkard, Quadratic assignment problems, European Journal of Operational Research 15 (1984) 282-289.
5. D.T. Connolly, An improved annealing scheme for the QAP, European Journal of Operational Research 46 (1990) 93-100.
6. R.W. Eglese, Simulated annealing: A tool for operational research, European Journal of Operational Research 46 (1990) 271-281.
7. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
8. D.S. Johnson, Local optimisation and the traveling salesman problem, in: M.S. Paterson (Ed.), Lecture Notes in Computer Science 443, Springer, Berlin, 1990, pp. 446-461.
9. S. Kirkpatrick, C.D. Gelatt Jr., M.P. Vecchi, Optimisation by simulated annealing, Science 220 (4598) (1983) 671-680.
10. P.S. Laursen, Simulated annealing for the QAP - optimal tradeoff between simulation time and solution quality, European Journal of Operational Research 63 (1993) 238-243.
11. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimisation, Wiley, New York, 1979.
12. S. Lin, B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Operations Research 21 (1973) 498-516.
13. Z. Nahorski, R.V.V. Vidal (Eds.), Simulated Annealing Applied to Combinatorial Optimization, Special Issue of the Journal of Control and Cybernetics, Warszawa 25 (1) (1996).
14. G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimisation, Wiley, New York, 1988.
15. C.E. Nugent, T.E. Vollmann, J. Ruml, An experimental comparison of techniques for the assignment of facilities to location, Operations Research 16 (1968) 150-173.
16. max flowshop problem, Computers & Operations Research 17 (1990) 243-253.
17. I.H. Osman, C.N. Potts, Simulated annealing for permutation flow-shop scheduling, OMEGA 17 (1989) 551-557.
18. M. Pinedo, Scheduling Theory, Algorithm, and Systems, Prentice-Hall, Englewood Cliffs, 1995.
19. J. Sridhar, C. Rajendran, Scheduling in a cellular manufacturing system: A simulated annealing approach, International Journal of Production Research 31 (1993) 2927-2945.
20. R.V.V. Vidal (Ed.), Applied Simulated Annealing, LNEMS, No. 396, Springer, Heidelberg, 1993.