@article{MAKHILLJEAS2018131416586,
    title = {A Sport Tournament Scheduling by Genetic Algorithm with Swapping Method},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {13},
    number = {14},
    pages = {5796-5800},
    year = {2018},
    issn = {1816-949x},
    doi = {jeasci.2018.5796.5800},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2018.5796.5800},
    author = {Thiradet and},
    keywords = {Sport tournament,traveling tournament problem,mirrored traveling tournament problem,minimum total number of traveling,objective,interesting},
    abstract = {A sport tournament problem is considered the Traveling Tournament Problem (TTP). One interesting
type is the mirrored Traveling Tournament Problem (mTTP). The objective of the problem is to minimize either
the total number of traveling or the total distances of traveling or both. This research aims to find an optimized
solution of the mirrored traveling tournament problem with minimum total number of traveling. The solutions
consisting of traveling and scheduling tables are solved by using Genetic Algorithm (GA) with swapping
method. The numbers of traveling of all teams from obtained solutions are close to the lower bound theory of
number of traveling. Moreover, this algorithm generates better solutions than known results for most cases.}
    }