The Application of Chaos Immune Genetic Algorithm in Sequencing Problem of Sports Meeting

DOI

10.2991/cse.2013.3How to use a DOI?

Keywords

Sequencing, Traveling salesman, Chaos, Genetic algorithm, Immune algorithm

Abstract

The sequencing of sports meeting is quite complicated due to the huge number of people and events. A new immune genetic algorithm aiming at solving the sports meeting sequencing problem is proposed in this paper, namely the chaos immune genetic algorithm, which combines the immune algorithm, chaos algorithm and genetic algorithm together. It generates the initial population by ergodic property and randomness of chaotic motion to speed up search, and adds new chaotic sequence by concentration calculation and adjustment of immune principle to supplement populations and increase population diversity so as to avoid trapping in local optimum. Local optimization is conducted after crossover and mutation by chaos near the optimal solution to improve the accuracy of solution. Experimental results show that this algorithm can quickly find the optimal solution and better accomplish its application in sequencing problem of sports meeting.

Copyright

© 2013, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ying Pan
PY  - 2013/07
DA  - 2013/07
TI  - The Application of Chaos Immune Genetic Algorithm in Sequencing Problem of Sports Meeting
BT  - Proceedings of the 2nd International Conference on Advances in Computer Science and Engineering (CSE 2013)
PB  - Atlantis Press
SP  - 9
EP  - 12
SN  - 1951-6851
UR  - https://doi.org/10.2991/cse.2013.3
DO  - 10.2991/cse.2013.3
ID  - Pan2013/07
ER  -