A genetic algorithm for railway scheduling with environmental considerations
β Scribed by Vivian Salim; Xiaoqiang Cai
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 1015 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1364-8152
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper considers the scheduling problem to minimize total tardiness given multiple machines, ready times, sequence dependent setups, machine downtime and scarce tools. We develop a genetic algorithm based on random keys representation, elitist reproduction, Bernoulli crossover and immigration ty
In this paper we propose a modified genetic algorithm for the single machine scheduling problem with ready times. This algorithm improves the simple genetic algorithm by introducing two new steps: (1) a filtering step to filter out the worst solutions in each generation and fill in their positions w
Genetic algorithms (GA) have been widely used to solve planning problems. However, they require one to determine the optimal values of many genetic parameters, such as population sizes, crossover probability, mutation probability, and so on. To make matters worse, the most suitable combination of pa