New models for the mirrored traveling tournament problem.
Autor(a) principal: | |
---|---|
Data de Publicação: | 2012 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFOP |
Texto Completo: | http://www.repositorio.ufop.br/handle/123456789/6971 |
Resumo: | 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. |
id |
UFOP_ea3fdb4683c864b909118b9454f42cea |
---|---|
oai_identifier_str |
oai:localhost:123456789/6971 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Carvalho, Marco Antonio Moreira deLorena, Luiz Antonio Nogueirahttps://doi.org/10.1016/j.cie.2012.08.0022016-09-05T20:01:49Z2016-09-05T20:01:49Z2012CARVALHO, 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.0360-8352http://www.repositorio.ufop.br/handle/123456789/6971The 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.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.info:eu-repo/semantics/openAccessTraveling tournament problemSports schedulingInteger programmingNew models for the mirrored traveling tournament problem.info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPLICENSElicense.txtlicense.txttext/plain; charset=utf-8924http://www.repositorio.ufop.br/bitstream/123456789/6971/2/license.txt62604f8d955274beb56c80ce1ee5dcaeMD52ORIGINALARTIGO_NewModelsMirrored.pdfARTIGO_NewModelsMirrored.pdfapplication/pdf262952http://www.repositorio.ufop.br/bitstream/123456789/6971/1/ARTIGO_NewModelsMirrored.pdf830faabda8bdad76928a4979d2435ba7MD51123456789/69712019-10-14 10:16:42.379oai:localhost:123456789/6971RGVjbGFyYcOnw6NvIGRlIGRpc3RyaWJ1acOnw6NvIG7Do28tZXhjbHVzaXZhCgpPIHJlZmVyaWRvIGF1dG9yOgoKYSlEZWNsYXJhIHF1ZSBvIGRvY3VtZW50byBlbnRyZWd1ZSDDqSBzZXUgdHJhYmFsaG8gb3JpZ2luYWwgZSBxdWUgZGV0w6ltIG8gZGlyZWl0byBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcyBuZXN0YSBsaWNlbsOnYS4gRGVjbGFyYSB0YW1iw6ltIHF1ZSBhIGVudHJlZ2EgZG8gZG9jdW1lbnRvIG7Do28gaW5mcmluZ2UsIHRhbnRvIHF1YW50byBsaGUgw6kgcG9zc8OtdmVsIHNhYmVyLCBvcyBkaXJlaXRvcyBkZSBxdWFscXVlciBwZXNzb2Egb3UgZW50aWRhZGUuCgpiKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIGNvbnTDqW0gbWF0ZXJpYWwgZG8gcXVhbCBuw6NvIGRldMOpbSBvcyBkaXJlaXRvcyBkZSBhdXRvciwgZGVjbGFyYSBxdWUgb2J0ZXZlIGF1dG9yaXphw6fDo28gZG8gZGV0ZW50b3IgZG9zIGRpcmVpdG9zIGRlIGF1dG9yIHBhcmEgY29uY2VkZXIgw6AgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZGUgT3VybyBQcmV0by9VRk9QIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgZXNzZSBtYXRlcmlhbCwgY3Vqb3MgZGlyZWl0b3Mgc8OjbyBkZSB0ZXJjZWlyb3MsIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3UgY29udGXDumRvcyBkbyBkb2N1bWVudG8gZW50cmVndWUuCgpjKVNlIG8gZG9jdW1lbnRvIGVudHJlZ3VlIMOpIGJhc2VhZG8gZW0gdHJhYmFsaG8gZmluYW5jaWFkbyBvdSBhcG9pYWRvIHBvciBvdXRyYSBpbnN0aXR1acOnw6NvIHF1ZSBuw6NvIGEgVUZPUCwgZGVjbGFyYSBxdWUgY3VtcHJpdSBxdWFpc3F1ZXIgb2JyaWdhw6fDtWVzIGV4aWdpZGFzIHBlbG8gY29udHJhdG8gb3UgYWNvcmRvLgoKRepositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332019-10-14T14:16:42Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.pt_BR.fl_str_mv |
New models for the mirrored traveling tournament problem. |
title |
New models for the mirrored traveling tournament problem. |
spellingShingle |
New models for the mirrored traveling tournament problem. Carvalho, Marco Antonio Moreira de Traveling tournament problem Sports scheduling Integer programming |
title_short |
New models for the mirrored traveling tournament problem. |
title_full |
New models for the mirrored traveling tournament problem. |
title_fullStr |
New models for the mirrored traveling tournament problem. |
title_full_unstemmed |
New models for the mirrored traveling tournament problem. |
title_sort |
New models for the mirrored traveling tournament problem. |
author |
Carvalho, Marco Antonio Moreira de |
author_facet |
Carvalho, Marco Antonio Moreira de Lorena, Luiz Antonio Nogueira |
author_role |
author |
author2 |
Lorena, Luiz Antonio Nogueira |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Carvalho, Marco Antonio Moreira de Lorena, Luiz Antonio Nogueira |
dc.contributor.advisor1.fl_str_mv |
https://doi.org/10.1016/j.cie.2012.08.002 |
contributor_str_mv |
https://doi.org/10.1016/j.cie.2012.08.002 |
dc.subject.por.fl_str_mv |
Traveling tournament problem Sports scheduling Integer programming |
topic |
Traveling tournament problem Sports scheduling Integer programming |
description |
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. |
publishDate |
2012 |
dc.date.issued.fl_str_mv |
2012 |
dc.date.accessioned.fl_str_mv |
2016-09-05T20:01:49Z |
dc.date.available.fl_str_mv |
2016-09-05T20:01:49Z |
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.citation.fl_str_mv |
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. |
dc.identifier.uri.fl_str_mv |
http://www.repositorio.ufop.br/handle/123456789/6971 |
dc.identifier.issn.none.fl_str_mv |
0360-8352 |
identifier_str_mv |
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. 0360-8352 |
url |
http://www.repositorio.ufop.br/handle/123456789/6971 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFOP instname:Universidade Federal de Ouro Preto (UFOP) instacron:UFOP |
instname_str |
Universidade Federal de Ouro Preto (UFOP) |
instacron_str |
UFOP |
institution |
UFOP |
reponame_str |
Repositório Institucional da UFOP |
collection |
Repositório Institucional da UFOP |
bitstream.url.fl_str_mv |
http://www.repositorio.ufop.br/bitstream/123456789/6971/2/license.txt http://www.repositorio.ufop.br/bitstream/123456789/6971/1/ARTIGO_NewModelsMirrored.pdf |
bitstream.checksum.fl_str_mv |
62604f8d955274beb56c80ce1ee5dcae 830faabda8bdad76928a4979d2435ba7 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP) |
repository.mail.fl_str_mv |
repositorio@ufop.edu.br |
_version_ |
1801685712841474048 |