A complete search method for the relaxed traveling tournament problem

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 ha...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Filipe Brandão, JoãoPedro Pedroso
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2014
Materias:	90-08 Computational methods 90-XX Operations research mathematical programming Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/95c7bebf44ba460ba6c53c0e2963f990
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:95c7bebf44ba460ba6c53c0e2963f990
record_format	dspace
spelling	oai:doaj.org-article:95c7bebf44ba460ba6c53c0e2963f9902021-12-02T05:00:39ZA complete search method for the relaxed traveling tournament problem2192-440610.1007/s13675-013-0010-3https://doaj.org/article/95c7bebf44ba460ba6c53c0e2963f9902014-06-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000265https://doaj.org/toc/2192-4406The 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.Filipe BrandãoJoãoPedro PedrosoElsevierarticle90-08 Computational methods90-XX Operations researchmathematical programmingApplied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 2, Iss 1, Pp 77-86 (2014)
institution	DOAJ
collection	DOAJ
language	EN
topic	90-08 Computational methods 90-XX Operations research mathematical programming Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90-08 Computational methods 90-XX Operations research mathematical programming Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Filipe Brandão JoãoPedro Pedroso A complete search method for the relaxed traveling tournament problem
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.
format	article
author	Filipe Brandão JoãoPedro Pedroso
author_facet	Filipe Brandão JoãoPedro Pedroso
author_sort	Filipe Brandão
title	A complete search method for the relaxed traveling tournament problem
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	complete search method for the relaxed traveling tournament problem
publisher	Elsevier
publishDate	2014
url	https://doaj.org/article/95c7bebf44ba460ba6c53c0e2963f990
work_keys_str_mv	AT filipebrandao acompletesearchmethodfortherelaxedtravelingtournamentproblem AT joaopedropedroso acompletesearchmethodfortherelaxedtravelingtournamentproblem AT filipebrandao completesearchmethodfortherelaxedtravelingtournamentproblem AT joaopedropedroso completesearchmethodfortherelaxedtravelingtournamentproblem
_version_	1718400842553360384

A complete search method for the relaxed traveling tournament problem

Ejemplares similares