Mostra el registre d'ítem simple
A GA(TS) hybrid algorithm for scheduling in computational grids
dc.contributor.author | Xhafa Xhafa, Fatos |
dc.contributor.author | González, Juan A. |
dc.contributor.author | Dahal, Keshav P. |
dc.contributor.author | Abraham, Ajith |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2018-07-25T08:02:58Z |
dc.date.available | 2018-07-25T08:02:58Z |
dc.date.issued | 2009 |
dc.identifier.citation | Xhafa, F., González, J. A., Dahal, K. P., Abraham, A. A GA(TS) hybrid algorithm for scheduling in computational grids. A: International Conference on Hybrid Artificial Intelligence Systems. "Hybrid Artificial Intelligence Systems, 4th International Conference, HAIS 2009: Salamanca, Spain, June 10-12, 2009: proceedings". Berlín: Springer, 2009, p. 285-292. |
dc.identifier.isbn | 978-3-642-02319-4 |
dc.identifier.uri | http://hdl.handle.net/2117/119899 |
dc.description.abstract | The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In this paper we present a hybridization of Genetic Algorithms (GAs) and Tabu Search (TS) for scheduling in computational grids. The purpose in this hybridization is to benefit the exploration of the solution space by a population of individuals with the exploitation of solutions through a smart search of the TS. Our GA(TS) hybrid algorithm runs the GA as the main algorithm and calls TS procedure to improve individuals of the population. We evaluated the proposed hybrid algorithm using different Grid scenarios generated by a Grid simulator. The computational results showed that the hybrid algorithm outperforms both the GA and TS for the makespan value but cannot outperform them for the flowtime of the scheduling. |
dc.format.extent | 8 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Computational grids (Computer systems) |
dc.subject.lcsh | Genetic algorithms |
dc.subject.other | Tabu search |
dc.subject.other | Computational grid |
dc.subject.other | Hybrid algorithm |
dc.subject.other | Grid resource |
dc.subject.other | Tabu search algorithm |
dc.title | A GA(TS) hybrid algorithm for scheduling in computational grids |
dc.type | Conference report |
dc.subject.lemac | Computació distribuïda |
dc.subject.lemac | Algorismes genètics |
dc.identifier.doi | 10.1007/978-3-642-02319-4_34 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://link.springer.com/chapter/10.1007/978-3-642-02319-4_34 |
dc.rights.access | Open Access |
local.identifier.drac | 22429120 |
dc.description.version | Postprint (author's final draft) |
local.citation.author | Xhafa, F.; González, J. A.; Dahal, K. P.; Abraham, A. |
local.citation.contributor | International Conference on Hybrid Artificial Intelligence Systems |
local.citation.pubplace | Berlín |
local.citation.publicationName | Hybrid Artificial Intelligence Systems, 4th International Conference, HAIS 2009: Salamanca, Spain, June 10-12, 2009: proceedings |
local.citation.startingPage | 285 |
local.citation.endingPage | 292 |