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

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

74 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)81-94
Journal / PublicationEuropean Journal of Operational Research
Volume118
Issue number1
Publication statusPublished - 1 Oct 1999

Abstract

Focusing on the generation mechanism of random permutation solutions, this paper investigates the application of the Simulated Annealing (SA) algorithm to the combinatorial optimization problems with permutation property. Six types of perturbation scheme for generating random permutation solutions are introduced. They are proved to satisfy the asymptotical convergence requirements. The results of experimental evaluations on Traveling Salesman Problem (TSP), Flow-shop Scheduling Problem (FSP), and Quadratic Assignment Problem (QAP) reveal that the efficiencies of the perturbation schemes are different in searching a solution space. By adopting a proper perturbation scheme, the SA algorithm has shown to produce very efficient solutions to different combinatorial optimization problems with permutation property.

Citation Format(s)

Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property : An investigation of generation mechanism. / Tian, Peng; Ma, Jian; Zhang, Dong-Mo.

In: European Journal of Operational Research, Vol. 118, No. 1, 01.10.1999, p. 81-94.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review