Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A genetic algorithm for public transport driver scheduling
Computers and Operations Research - Special issue on genetic algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Selected Papers from AISB Workshop on Evolutionary Computing
Selected Papers from AISB Workshop on Evolutionary Computing
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Timetabling the Classes of an Entire University with an Evolutionary Algorithm
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Selected Papers from AISB Workshop on Evolutionary Computing
Scheduling Planned Maintenance of the National Grid
Selected Papers from AISB Workshop on Evolutionary Computing
Solving a real-world problem using an evolving heuristically driven schedule builder
Evolutionary Computation
Hi-index | 0.00 |
The production of a roster for the duties of ambulance crew is subject to a variety of practical, managerial and social constraints. This document describes the first steps of an investigation into the characteristics of the search space for such a problem and reports on the success to date of an evolutionary algorithm approach in finding an acceptable solution to the problem. The visualisation method described is suggested as a quicker way of testing the appropriateness of representations than having to perform multiple time consuming experiments.