Genetic algorithm for information operator scheduling

Telephone information operator scheduling is a real-world optimisation problem. A genetic algorithm using a concise representation of solutions for the problem is successfully applied. It is shown that mutation is important for the problem. We propose an effective mutation operator and demonstrate its advantages through numerical experiments. Partial reinitialization of individuals is also introduced in order to reintroduce diversity into the population and avoid premature convergence. The experimental results show that the reinitialization strategy improves the search performance