A complete search method for the relaxed traveling tournament problem

Detalhes bibliográficos
Autor(a) principal: Filipe Daniel Brandão
Data de Publicação: 2014
Outros Autores: João Pedro Pedroso
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://repositorio.inesctec.pt/handle/123456789/4678
http://dx.doi.org/10.1007/s13675-013-0010-3
Resumo: The traveling tournament problem is a sports scheduling problem that includes two major issues in creating timetables: home/away pattern feasibility and travel distance. In this problem, the schedule must be compact: every team plays in every time slot. However, there are some sports leagues that have both home/away pattern restrictions and distance limits, but do not require a compact schedule. In such schedules, one or more teams can have a bye in any time slot. This leads us to a variant of the problem: the relaxed traveling tournament problem. We present a complete search method to solve this problem based on branch-and-bound, metaheuristics and dynamic programming. © 2013, Springer-Verlag Berlin Heidelberg and EURO - The Association of European Operational Research Societies.
id RCAP_ac7e15960f7d6be76ef52069e64f4245
oai_identifier_str oai:repositorio.inesctec.pt:123456789/4678
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A complete search method for the relaxed traveling tournament problemThe traveling tournament problem is a sports scheduling problem that includes two major issues in creating timetables: home/away pattern feasibility and travel distance. In this problem, the schedule must be compact: every team plays in every time slot. However, there are some sports leagues that have both home/away pattern restrictions and distance limits, but do not require a compact schedule. In such schedules, one or more teams can have a bye in any time slot. This leads us to a variant of the problem: the relaxed traveling tournament problem. We present a complete search method to solve this problem based on branch-and-bound, metaheuristics and dynamic programming. © 2013, Springer-Verlag Berlin Heidelberg and EURO - The Association of European Operational Research Societies.2017-12-21T14:54:09Z2014-01-01T00:00:00Z2014info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/4678http://dx.doi.org/10.1007/s13675-013-0010-3engFilipe Daniel BrandãoJoão Pedro Pedrosoinfo:eu-repo/semantics/embargoedAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-05-15T10:20:40Zoai:repositorio.inesctec.pt:123456789/4678Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:53:27.429948Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A complete search method for the relaxed traveling tournament problem
title A complete search method for the relaxed traveling tournament problem
spellingShingle A complete search method for the relaxed traveling tournament problem
Filipe Daniel Brandão
title_short A complete search method for the relaxed traveling tournament problem
title_full A complete search method for the relaxed traveling tournament problem
title_fullStr A complete search method for the relaxed traveling tournament problem
title_full_unstemmed A complete search method for the relaxed traveling tournament problem
title_sort A complete search method for the relaxed traveling tournament problem
author Filipe Daniel Brandão
author_facet Filipe Daniel Brandão
João Pedro Pedroso
author_role author
author2 João Pedro Pedroso
author2_role author
dc.contributor.author.fl_str_mv Filipe Daniel Brandão
João Pedro Pedroso
description The traveling tournament problem is a sports scheduling problem that includes two major issues in creating timetables: home/away pattern feasibility and travel distance. In this problem, the schedule must be compact: every team plays in every time slot. However, there are some sports leagues that have both home/away pattern restrictions and distance limits, but do not require a compact schedule. In such schedules, one or more teams can have a bye in any time slot. This leads us to a variant of the problem: the relaxed traveling tournament problem. We present a complete search method to solve this problem based on branch-and-bound, metaheuristics and dynamic programming. © 2013, Springer-Verlag Berlin Heidelberg and EURO - The Association of European Operational Research Societies.
publishDate 2014
dc.date.none.fl_str_mv 2014-01-01T00:00:00Z
2014
2017-12-21T14:54:09Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://repositorio.inesctec.pt/handle/123456789/4678
http://dx.doi.org/10.1007/s13675-013-0010-3
url http://repositorio.inesctec.pt/handle/123456789/4678
http://dx.doi.org/10.1007/s13675-013-0010-3
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/embargoedAccess
eu_rights_str_mv embargoedAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799131609041993728

Registros relacionados