Abstract
Three algorithms are tested on the satellite range scheduling problem, using data from the U.S. Air Force Satellite Control Network; a simple heuristic, as well as local search methods, are compared against a genetic algorithm on old benchmark problems as well as problems produced by a generator we recently developed. The simple heuristic works well on the old benchmark, but fails to scale to larger, more complex problems produced by our generator. The genetic algorithm yields the best overall performance on larger, more difficult problems.KeywordsGenetic AlgorithmSchedule ProblemLocal SearchMixed Integer ProgrammingUser RequestThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
