@conference {Aylaj2016557,
	title = {Degeneration simulated annealing algorithm for combinatorial optimization problems},
	booktitle = {International Conference on Intelligent Systems Design and Applications, ISDA},
	volume = {2016-June},
	year = {2016},
	note = {cited By 0},
	pages = {557-562},
	abstract = {In this paper, we use the physical aspect of the simulated annealing method in order to propose a modified simulated annealing algorithm. The main idea of the algorithm is based to find the optimal solution of a combinatorial optimization problem by switching between two different subsystems of treatment; using so called degeneration of atoms energy. This new algorithm is named Degeneration Simulated Annealing (DSA) algorithm. To illustrate the effectiveness of DSA, it is applied to solve the problems of the minimum distance and the decoding, in coding theory. The computational experiment results obtained by DSA are very interesting. {\textcopyright} 2015 IEEE.},
	doi = {10.1109/ISDA.2015.7489177},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84978430456\&doi=10.1109\%2fISDA.2015.7489177\&partnerID=40\&md5=0471da6bb951204df77f8f7a184b034d},
	author = {Aylaj, B.a and Belkasmi, M.b and Zouaki, H.a and Berkani, A.b}
}
