Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem

Kristian Verduin; Sarah Thomson; Daan van den Berg

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem

Topics: Applications: Games and Entertainment Technologies, Evolutionary Robotics, Evolutionary Art and Design, Industrial and Real World applications, Computational Economics and Finance; Evolutionary Search and Meta-heuristics ; Genetic Algorithms

In Proceedings of the 15th International Joint Conference on Computational Intelligence ECTA - Volume 1, 246-257, 2023 , Rome, Italy

Authors: Kristian Verduin ¹ ; Sarah Thomson ² and Daan van den Berg ¹

Affiliations: ¹ Department of Computer Science, Vrije Universiteit Amsterdam and Universiteit van Amsterdam, The Netherlands ; ² Edinburgh Napier University, U.K.

Keyword(s): The Traveling Tournament Problem, Constraints, Genetic Algorithms, Evolutionary Computing, Constraint Hierarchy.

Abstract: Unlike other NP-hard problems, the constraints on the traveling tournament problem are so pressing that it’s hardly possible to randomly generate a valid solution, for example, to use in a genetic algorithm’s initial population. In this study, we randomly generate solutions, assess the numbers of constraint violations, and extrapolate the results to predict the required number of samples for obtaining a single valid solution for any reasonable instance size. As it turns out, these numbers are astronomical, and we finish the study by discussing the feasibility of efficient sampling of valid solutions to various NP-hard problems.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.147.51.191

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Verduin, K.; Thomson, S. and van den Berg, D. (2023). Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem. In Proceedings of the 15th International Joint Conference on Computational Intelligence - ECTA; ISBN 978-989-758-674-3; ISSN 2184-3236, SciTePress, pages 246-257. DOI: 10.5220/0012192100003595

@conference{ecta23,
author={Kristian Verduin. and Sarah Thomson. and Daan {van den Berg}.},
title={Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem},
booktitle={Proceedings of the 15th International Joint Conference on Computational Intelligence - ECTA},
year={2023},
pages={246-257},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012192100003595},
isbn={978-989-758-674-3},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 15th International Joint Conference on Computational Intelligence - ECTA
TI - Too Constrained for Genetic Algorithms too Hard for Evolutionary Computing the Traveling Tournament Problem
SN - 978-989-758-674-3
IS - 2184-3236
AU - Verduin, K.
AU - Thomson, S.
AU - van den Berg, D.
PY - 2023
SP - 246
EP - 257
DO - 10.5220/0012192100003595
PB - SciTePress