Mostra el registre d'ítem simple
Hybridizing Beam-ACO with constraint programming for single machine job scheduling
dc.contributor.author | Thiruvady, Dhananjay |
dc.contributor.author | Blum, Christian |
dc.contributor.author | Meyer, Bernd |
dc.contributor.author | Ernst, Andreas T. |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2010-05-05T12:13:51Z |
dc.date.available | 2010-05-05T12:13:51Z |
dc.date.created | 2009 |
dc.date.issued | 2009 |
dc.identifier.citation | Thiruvady, D. [et al.]. Hybridizing Beam-ACO with constraint programming for single machine job scheduling. "Lecture notes in computer science", 2009, vol. 5818, p. 30-44. |
dc.identifier.issn | 0302-9743 |
dc.identifier.uri | http://hdl.handle.net/2117/7131 |
dc.description.abstract | A recent line of research concerns the integration of ant colony optimization and constraint programming. Hereby, constraint programming is used for eliminating parts of the search tree during the solution construction of ant colony optimization. In the context of a single machine scheduling problem, for example, it has been shown that the integration of constraint programming can significantly improve the ability of ant colony optimization to find feasible solutions. One of the remaining problems, however, concerns the elevated computation time requirements of the hybrid algorithm, which are due to constraint propagation. In this work we propose a possible solution to this problem by integrating constraint programming with a specific version of ant colony optimization known as Beam-ACO. The idea is to reduce the time spent for constraint propagation by parallelizing the solution construction process as done in Beam-ACO. The results of the proposed algorithm show indeed that it is currently the best performing algorithm for the above mentioned single machine job scheduling problem. |
dc.format.extent | 15 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial |
dc.subject.lcsh | Heuristic programming. |
dc.title | Hybridizing Beam-ACO with constraint programming for single machine job scheduling |
dc.type | Article |
dc.subject.lemac | Programació heurística |
dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.identifier.doi | 10.1007/978-3-642-04918-7_3 |
dc.description.peerreviewed | Peer Reviewed |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 2318260 |
dc.description.version | Postprint (published version) |
local.citation.author | Thiruvady, D.; Blum, C.; Meyer, B.; Ernst, A. |
local.citation.publicationName | Lecture notes in computer science |
local.citation.volume | 5818 |
local.citation.startingPage | 30 |
local.citation.endingPage | 44 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]
-
Articles de revista [274]