A heuristic for the multiple tour maximum collection problem
Computers and Operations Research
IEEE Computational Science & Engineering
The State of the Art of Nurse Rostering
Journal of Scheduling
Metaheuristics for the team orienteering problem
Journal of Heuristics
Computers and Operations Research
Iterated local search for the team orienteering problem with time windows
Computers and Operations Research
Heuristics for the multi-period orienteering problem with multiple time windows
Computers and Operations Research
Operating theatre scheduling with patient recovery in both operating rooms and recovery beds
Computers and Industrial Engineering
A SOMO-based approach to the operating room scheduling problem
Expert Systems with Applications: An International Journal
Integrating public transportation in personalised electronic tourist guides
Computers and Operations Research
Hi-index | 0.00 |
This paper presents a genetic algorithm for the Team Orienteering Problem with double Time Windows (TOPdTW). The aim is to study TOPdTW to model a real problem that arises within the operating rooms in a hospital. The Genetic Algorithm uses a peculiar way to construct solutions that only generates valid solutions, which improves the global performance. This constructive algorithm reads the chromosome and decides which operation is scheduled next in the route. The algorithm was tested using some public instances of the TOPTW and instances generated for TOPdTW. The computational results are presented.