| dc.contributor.author | Nordli, Thomas | |
| dc.contributor.author | Bouhmala, Noureddine | |
| dc.date.accessioned | 2022-01-07T12:46:18Z | |
| dc.date.available | 2022-01-07T12:46:18Z | |
| dc.date.created | 2021-12-08T14:58:58Z | |
| dc.date.issued | 2022 | |
| dc.identifier.citation | Nordli, T., & Bouhmala, N. (2022). A Look-Ahead Based Meta-Heuristics for Optimizing Continuous Optimization Problems. I International Conference on Optimization, Learning Algorithms and Applications (s. 48-55). Springer, Cham. | en_US |
| dc.identifier.isbn | 978-3-030-91885-9 | |
| dc.identifier.issn | 1865-0929 | |
| dc.identifier.uri | https://hdl.handle.net/11250/2836508 | |
| dc.description.abstract | In this paper, the famous kernighan-Lin algorithm is adjusted and embedded into the simulated annealing algorithm and the genetic algorithm for continuous optimization problems. The performance of the different algorithms are evaluated using a set of well known optimization test functions. | en_US |
| dc.language.iso | eng | en_US |
| dc.title | A Look-Ahead Based Meta-Heuristics for Optimizing Continuous Optimization Problems | en_US |
| dc.type | Chapter | en_US |
| dc.type | Peer reviewed | en_US |
| dc.description.version | acceptedVersion | en_US |
| dc.rights.holder | © Springer Nature Switzerland AG 2021 | en_US |
| dc.source.pagenumber | 48-55 | en_US |
| dc.source.volume | 1488 | en_US |
| dc.identifier.doi | https://doi.org/10.1007/978-3-030-91885-9_4 | |
| dc.identifier.cristin | 1966293 | |
| cristin.ispublished | true | |
| cristin.fulltext | original | |
| cristin.qualitycode | 1 | |
