A sport tournament scheduling by genetic algorithm with swapping method

Journal article

Authors/Editors

Strategic Research Themes

No matching items found.

Publication Details

Author list: Rutjanisarakul T., Jiarasuksakun T.

Publisher: Medwell Journals

Publication year: 2018

Volume number: 13

Issue number: 14

Start page: 5796

End page: 5800

Number of pages: 5

ISSN: 1816-949X

eISSN: 1816-949X

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85052972894&doi=10.3923%2fjeasci.2018.5796.5800&partnerID=40&md5=8267edf87f7469d4694c6f598ac7a142

Languages: English-Great Britain (EN-GB)

View on publisher site

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 number 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. ฉ Medwell Journals, 2018.

Keywords

Interesting, Minimum total number of traveling, Minored traveling tournament problem, Objective, Sport tournament traveling tournament problem