Por favor, use este identificador para citar o enlazar este ítem:
http://www.repositorio.ufop.br/jspui/handle/123456789/6971
Título : | New models for the mirrored traveling tournament problem. |
Autor : | Carvalho, Marco Antonio Moreira de Lorena, Luiz Antonio Nogueira |
metadata.dc.contributor.advisor: | https://doi.org/10.1016/j.cie.2012.08.002 |
Palabras clave : | Traveling tournament problem Sports scheduling Integer programming |
Fecha de publicación : | 2012 |
Citación : | CARVALHO, M. A. M. de.; LORENA, L. A. N. New models for the Mirrored Traveling Tournament Problem. Computers & Industrial Engineering, v. 63, p. 1089-1095, 2012. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0360835212001726>. Acesso em: 07 ago. 2016. |
Resumen : | The Mirrored Traveling Tournament Problem (mTTP) is a challenging combinatorial optimization problem which consists in generating a timetable for sports tournaments with two half series, what is equivalent to a double round-robin timetable problem. The distance traveled by the teams should be minimized in the final timetable, and a new objective is to minimize the longest distance traveled, named MinMaxTTP. It is proposed an integer programming formulation to the mTTP and two models with dynamic constraints to its solution. Both models are based on the detection of independent sets on conflict graphs, whose use has not been reported in the literature about the problem. Real data benchmarks from a baseball tournament are used in the experiments carried out. |
URI : | http://www.repositorio.ufop.br/handle/123456789/6971 |
ISSN : | 0360-8352 |
metadata.dc.rights.license: | O periódico Computers & Industrial Engineering concede permissão para depósito deste artigo no Repositório Institucional da UFOP. Número da licença: 3934300390024. |
Aparece en las colecciones: | DECOM - Artigos publicados em periódicos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
ARTIGO_NewModelsMirrored.pdf | 256,79 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.