Journal of Engineering and Applied Sciences

105
Views

1
Downloads

A Sport Tournament Scheduling by Genetic Algorithm with Swapping Method

Tinnaluk Rutjanisarakul and Thiradet Jiarasuksakun
Page: 5796-5800 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

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.

How to cite this article:

Tinnaluk Rutjanisarakul and Thiradet Jiarasuksakun. A Sport Tournament Scheduling by Genetic Algorithm with Swapping Method.
DOI: https://doi.org/10.36478/jeasci.2018.5796.5800
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2018.5796.5800