Hypercube FrameWork for ACO applied to timetabling

Autores
Johnson, Franklin; Crawford, Broderick; Palma Muñoz, Wenceslao Enrique
Año de publicación
2006
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restrictions. We solve experimental instances and competition instances the results are presented of comparative form to other techniques. We presented an appropriate construction graph and pheromone matrix representation. A representative instance is solved in addition to the schedules of the school of Computer science engineering of the Catholic University of Valparaiso. The results obtained for this instance appear. Finally the conclusions are given.
IFIP International Conference on Artificial Intelligence in Theory and Practice - Evolutionary Computation
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
University course Timetabling problem (UCTP)
Max-Min Ant system
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23914
Acceder
id SEDICI_7d4f09e7d7f0ad1607f8a8904a289217
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23914
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Hypercube FrameWork for ACO applied to timetablingJohnson, FranklinCrawford, BroderickPalma Muñoz, Wenceslao EnriqueCiencias InformáticasUniversity course Timetabling problem (UCTP)Max-Min Ant systemWe present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restrictions. We solve experimental instances and competition instances the results are presented of comparative form to other techniques. We presented an appropriate construction graph and pheromone matrix representation. A representative instance is solved in addition to the schedules of the school of Computer science engineering of the Catholic University of Valparaiso. The results obtained for this instance appear. Finally the conclusions are given.IFIP International Conference on Artificial Intelligence in Theory and Practice - Evolutionary ComputationRed de Universidades con Carreras en Informática (RedUNCI)2006-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23914enginfo:eu-repo/semantics/altIdentifier/isbn/0-387-34654-6info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-22T16:37:10Zoai:sedici.unlp.edu.ar:10915/23914Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 16:37:10.391SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Hypercube FrameWork for ACO applied to timetabling
title Hypercube FrameWork for ACO applied to timetabling
spellingShingle Hypercube FrameWork for ACO applied to timetabling
Johnson, Franklin
Ciencias Informáticas
University course Timetabling problem (UCTP)
Max-Min Ant system
title_short Hypercube FrameWork for ACO applied to timetabling
title_full Hypercube FrameWork for ACO applied to timetabling
title_fullStr Hypercube FrameWork for ACO applied to timetabling
title_full_unstemmed Hypercube FrameWork for ACO applied to timetabling
title_sort Hypercube FrameWork for ACO applied to timetabling
dc.creator.none.fl_str_mv Johnson, Franklin
Crawford, Broderick
Palma Muñoz, Wenceslao Enrique
author Johnson, Franklin
author_facet Johnson, Franklin
Crawford, Broderick
Palma Muñoz, Wenceslao Enrique
author_role author
author2 Crawford, Broderick
Palma Muñoz, Wenceslao Enrique
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
University course Timetabling problem (UCTP)
Max-Min Ant system
topic Ciencias Informáticas
University course Timetabling problem (UCTP)
Max-Min Ant system
dc.description.none.fl_txt_mv We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restrictions. We solve experimental instances and competition instances the results are presented of comparative form to other techniques. We presented an appropriate construction graph and pheromone matrix representation. A representative instance is solved in addition to the schedules of the school of Computer science engineering of the Catholic University of Valparaiso. The results obtained for this instance appear. Finally the conclusions are given.
IFIP International Conference on Artificial Intelligence in Theory and Practice - Evolutionary Computation
Red de Universidades con Carreras en Informática (RedUNCI)
description We present a resolution technique of the University course Timetabling problem (UCTP), this technique is based in the implementation of Hypercube framework using the Max-Min Ant System. We presented the structure of the problem and the design of resolution using this framework. A simplification of the UCTP problem is used, involving three types of hard restrictions and three types of soft restrictions. We solve experimental instances and competition instances the results are presented of comparative form to other techniques. We presented an appropriate construction graph and pheromone matrix representation. A representative instance is solved in addition to the schedules of the school of Computer science engineering of the Catholic University of Valparaiso. The results obtained for this instance appear. Finally the conclusions are given.
publishDate 2006
dc.date.none.fl_str_mv 2006-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23914
url http://sedici.unlp.edu.ar/handle/10915/23914
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/0-387-34654-6
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846782832907649024
score 12.982451

Publicaciones similares