Generic Simulated Annealing  

作　　者：Chadi Kallab Samir Haddad Jinane Sayah Mohamad Chakroun Chadi Kallab;Samir Haddad;Jinane Sayah;Mohamad Chakroun(Department of Computer Science and Mathematics, Faculty of Arts and Sciences, University of Balamand, Koura, Lebanon;Department of Telecom and Networks, Issam Fares Faculty of Technology, University of Balamand, Koura, Lebanon;Faculty of Computer Science and Electrical Engineering, Universität Rostock, Rostock, Germany)

机构地区：[1]Department of Computer Science and Mathematics, Faculty of Arts and Sciences, University of Balamand, Koura, Lebanon [2]Department of Telecom and Networks, Issam Fares Faculty of Technology, University of Balamand, Koura, Lebanon [3]Faculty of Computer Science and Electrical Engineering, Universitä t Rostock, Rostock, Germany

出　　处：《Open Journal of Applied Sciences》2022年第6期1011-1025,共15页应用科学（英文）

摘　　要：One of the many problems that are considered to be NP-Hard is the Multiple Sequence Alignment one that initially requires, as for any other of its siblings, a specific encoding schema and design of the main functionalities of the heuristics algorithm being implemented and executed. This paper intends to discuss our proposed generic implementation of the Simulated Annealing, inspired for the procedure of cooling and shaping methods of metals. In our algorithm, we attempted to add some executions tracing functionalities in order to help later analysis for initial parameters tuning. On another hand, we also tried to get closer in our attempt to mimic the cooling of metals, but giving it an option to run under different cooling schedules. We proposed a few schedules that seemed to be studied and/or used in many algorithm implementations.One of the many problems that are considered to be NP-Hard is the Multiple Sequence Alignment one that initially requires, as for any other of its siblings, a specific encoding schema and design of the main functionalities of the heuristics algorithm being implemented and executed. This paper intends to discuss our proposed generic implementation of the Simulated Annealing, inspired for the procedure of cooling and shaping methods of metals. In our algorithm, we attempted to add some executions tracing functionalities in order to help later analysis for initial parameters tuning. On another hand, we also tried to get closer in our attempt to mimic the cooling of metals, but giving it an option to run under different cooling schedules. We proposed a few schedules that seemed to be studied and/or used in many algorithm implementations.

关 键 词：GENERIC HEURISTICS PHYLOGENIES Bio-Informatics NP-HARD Simulated Annealing 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]