A genetic algorithm approach for solving the daily photograph selection problem of the SPOT5 satellite

Authors:
Mohamed A. A. Mansour;Maged M. Dessouky
Affiliations:
Industrial Engineering Department, Faculty of Engineering, Zagazig University, Zagazig, Egypt;Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California, Los Angeles, CA 90089-0193, United States
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 6
Cited 1

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite

Computational Optimization and Applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Earth Observation Satellite Management

Constraints
Valued constraint satisfaction problems: hard and easy problems

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A two-phase scheduling method with the consideration of task clustering for earth observing satellites

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article addresses the combinatorial optimization problem of managing earth observation satellites (EOSs) such as the French SPOT5, which is concerned with selecting on each day a subset of a set of candidate photographs. The problem has a significant economic importance due to its high initial investment cost that exists in these instruments and its solution difficulty resulting from the large solution space, making it an attractive research area. This article proposes a genetic algorithm (GA) for solving the SPOT5 selection problem using a new genome representation for maximizing not only a single objective as profit but a multi-criteria objective that includes the number of acquired photographs. Test results of our proposed GA show that it finds optimal solutions effectively for moderate size problems and obtains better results for two large benchmark instances coded 1403 and 1504 in the literature. Also, we verify the result that the best known value in the literature for problem coded 1401 is an optimal value.