Reducing calibration effort for clonal selection based algorithms: A reinforcement learning approach. Knowledge-Based Systems, 41:54-67, 2013. doi abstract bibtex In this paper we introduce (C, n)-strategy which improves the former C-strategy for on-line calibration of Clonal Selection based algorithms. In this approach, we are focused on a trade-off between the intensification and the diversification of the algorithm search. By using our approach, it allows us to reduce the number of the parameters of the algorithm respecting both the original design of the algorithm and its performance. The number of selected cells and the number of clones are dynamically controlled on-line, according to the algorithm's behavior. We report statistical comparisons using well-known clonalg based algorithms for solving combinatorial optimization problems. From the tests, we conclude that the tuning effort for Clonalg based algorithms is strongly reduced using our technique. Moreover, the dynamic control does not decrease the performance of the original version of the algorithm. On the contrary, it has shown to improve it. © 2012 Elsevier B.V. All rights reserved.
@article{10.1016/j.knosys.2012.12.009,
abstract = "In this paper we introduce (C, n)-strategy which improves the former C-strategy for on-line calibration of Clonal Selection based algorithms. In this approach, we are focused on a trade-off between the intensification and the diversification of the algorithm search. By using our approach, it allows us to reduce the number of the parameters of the algorithm respecting both the original design of the algorithm and its performance. The number of selected cells and the number of clones are dynamically controlled on-line, according to the algorithm's behavior. We report statistical comparisons using well-known clonalg based algorithms for solving combinatorial optimization problems. From the tests, we conclude that the tuning effort for Clonalg based algorithms is strongly reduced using our technique. Moreover, the dynamic control does not decrease the performance of the original version of the algorithm. On the contrary, it has shown to improve it. © 2012 Elsevier B.V. All rights reserved.",
year = "2013",
title = "Reducing calibration effort for clonal selection based algorithms: A reinforcement learning approach",
volume = "41",
pages = "54-67",
doi = "10.1016/j.knosys.2012.12.009",
journal = "Knowledge-Based Systems"
}
Downloads: 0
{"_id":"qR2KhRmWhAzzAkorB","bibbaseid":"anonymous-reducingcalibrationeffortforclonalselectionbasedalgorithmsareinforcementlearningapproach-2013","downloads":0,"creationDate":"2017-03-31T20:15:32.994Z","title":"Reducing calibration effort for clonal selection based algorithms: A reinforcement learning approach","author_short":null,"year":2013,"bibtype":"article","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"article","type":"article","abstract":"In this paper we introduce (C, n)-strategy which improves the former C-strategy for on-line calibration of Clonal Selection based algorithms. In this approach, we are focused on a trade-off between the intensification and the diversification of the algorithm search. By using our approach, it allows us to reduce the number of the parameters of the algorithm respecting both the original design of the algorithm and its performance. The number of selected cells and the number of clones are dynamically controlled on-line, according to the algorithm's behavior. We report statistical comparisons using well-known clonalg based algorithms for solving combinatorial optimization problems. From the tests, we conclude that the tuning effort for Clonalg based algorithms is strongly reduced using our technique. Moreover, the dynamic control does not decrease the performance of the original version of the algorithm. On the contrary, it has shown to improve it. © 2012 Elsevier B.V. All rights reserved.","year":"2013","title":"Reducing calibration effort for clonal selection based algorithms: A reinforcement learning approach","volume":"41","pages":"54-67","doi":"10.1016/j.knosys.2012.12.009","journal":"Knowledge-Based Systems","bibtex":"@article{10.1016/j.knosys.2012.12.009,\n abstract = \"In this paper we introduce (C, n)-strategy which improves the former C-strategy for on-line calibration of Clonal Selection based algorithms. In this approach, we are focused on a trade-off between the intensification and the diversification of the algorithm search. By using our approach, it allows us to reduce the number of the parameters of the algorithm respecting both the original design of the algorithm and its performance. The number of selected cells and the number of clones are dynamically controlled on-line, according to the algorithm's behavior. We report statistical comparisons using well-known clonalg based algorithms for solving combinatorial optimization problems. From the tests, we conclude that the tuning effort for Clonalg based algorithms is strongly reduced using our technique. Moreover, the dynamic control does not decrease the performance of the original version of the algorithm. On the contrary, it has shown to improve it. © 2012 Elsevier B.V. All rights reserved.\",\n year = \"2013\",\n title = \"Reducing calibration effort for clonal selection based algorithms: A reinforcement learning approach\",\n volume = \"41\",\n pages = \"54-67\",\n doi = \"10.1016/j.knosys.2012.12.009\",\n journal = \"Knowledge-Based Systems\"\n}\n\n","key":"10.1016/j.knosys.2012.12.009","id":"10.1016/j.knosys.2012.12.009","bibbaseid":"anonymous-reducingcalibrationeffortforclonalselectionbasedalgorithmsareinforcementlearningapproach-2013","urls":{},"downloads":0,"html":""},"search_terms":["reducing","calibration","effort","clonal","selection","based","algorithms","reinforcement","learning","approach"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}