%0 Journal Article
%@holdercode {isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}
%@archivingpolicy denypublisher denyfinaldraft36
%@nexthigherunit 8JMKD3MGPCW/3ESGTTP
%@secondarytype PRE PI
%@issn 0360-8352
%D 2012
%4 dpi.inpe.br/plutao/2012/11.28.18.47.40
%T New models for the mirrored traveling tournament problem
%@usergroup administrator
%@usergroup banon
%@usergroup lattes
%@usergroup marciana
%V 63
%@affiliation Ouro Preto Federal University
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%F lattes: 7195702087655314 2 MoreiradeCarvalhoNogu:2012:NeMoMi
%@resumeid
%@resumeid 8JMKD3MGP5W/3C9JHMQ
%@project FAPESP (2009/51831-9); CNPq (471837/2008-3), (300692/2009-9).
%X 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.
%@versiontype publisher
%@electronicmailaddress mamc@iceb.ufop.br
%@electronicmailaddress lorena@lac.inpe.br
%@secondarykey INPE--PRE/
%@area COMP
%@e-mailaddress lorena@lac.inpe.br
%K traveling tournament problem, sports scheduling, integer programming.
%@documentstage not transferred
%@doi 10.1016/j.cie.2012.08.002
%@group
%@group LAC-CTE-INPE-MCTI-GOV-BR
%@dissemination PORTALCAPES
%P 1089-1095
%A Moreira de Carvalho, Marco Antonio,
%A Nogueira Lorena, Luiz Antonio,
%2 dpi.inpe.br/plutao/2012/11.28.18.47.41
%B Computers and Industrial Engineering