Napredna pretraga

Pregled bibliografske jedinice broj: 653421

Hill Climbing and Simulated Annealing in Large Scale Next Release Problem


Mauša, Goran; Galinac Grbac, Tihana; Dalbelo Bašić, Bojana; Pavčević, Mario-Osvin
Hill Climbing and Simulated Annealing in Large Scale Next Release Problem // Proceedings of EuroCon 2013 / Kuzle, I. ; Capuder, T. ; Pandžić H. (ur.).
Zagreb, Hrvatska, 2013. str. 452-459 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


Naslov
Hill Climbing and Simulated Annealing in Large Scale Next Release Problem

Autori
Mauša, Goran ; Galinac Grbac, Tihana ; Dalbelo Bašić, Bojana ; Pavčević, Mario-Osvin

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of EuroCon 2013 / Kuzle, I. ; Capuder, T. ; Pandžić H. - , 2013, 452-459

ISBN
978-1-4673-2231-7

Skup
International conference on computer as a tool

Mjesto i datum
Zagreb, Hrvatska, 01-04.07.2013

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
next release problem; Hill Climbing; Simulated Annealing; large scale problem; realistic dataset

Sažetak
Next release problem is a software engineering problem, lately often solved using heuristic algorithms. It deals with selecting a subset of requirements that should appear in next release of a software product. The problem lies in satisfying various parts interested in project development with acceptable costs. This paper compares two rather simple, but often used and efficient heuristic algorithms: Hill Climbing and Simulated Annealing. The aim of this paper was to compare the performance of these algorithms and their modifications on a large scale problem. We investigated the differences between four variations of Hill Climbing and two variations of Simulated Annealing, while Random Search was used to verify the benefit of using a heuristic algorithm. The evaluation was performed in terms of finding the best solution for a given budget and in calculating the proportion of non-dominated solutions that form the joint Pareto-optimal front. Our research was done on publicly available realistic datasets that were obtained mining the bug repositories. The results indicate Simulated Annealing as the more successful algorithm but point out that Simulated Annealing together with Hill Climbing provides a more thorough insight into the problem search space.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Projekt / tema
069-0362214-1575 - Optimizacija i dizajn vremensko-frekvencijskih distribucija (Viktor Sučić, )

Ustanove
Fakultet elektrotehnike i računarstva, Zagreb,
Tehnički fakultet, Rijeka

Citiraj ovu publikaciju

Mauša, Goran; Galinac Grbac, Tihana; Dalbelo Bašić, Bojana; Pavčević, Mario-Osvin
Hill Climbing and Simulated Annealing in Large Scale Next Release Problem // Proceedings of EuroCon 2013 / Kuzle, I. ; Capuder, T. ; Pandžić H. (ur.).
Zagreb, Hrvatska, 2013. str. 452-459 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Mauša, G., Galinac Grbac, T., Dalbelo Bašić, B. & Pavčević, M. (2013) Hill Climbing and Simulated Annealing in Large Scale Next Release Problem. U: Kuzle, I., Capuder, T. & Pandžić H. (ur.)Proceedings of EuroCon 2013.
@article{article, year = {2013}, pages = {452-459}, keywords = {next release problem, Hill Climbing, Simulated Annealing, large scale problem, realistic dataset}, isbn = {978-1-4673-2231-7}, title = {Hill Climbing and Simulated Annealing in Large Scale Next Release Problem}, keyword = {next release problem, Hill Climbing, Simulated Annealing, large scale problem, realistic dataset}, publisherplace = {Zagreb, Hrvatska} }