Abstract
The paper describes an adaptation of a memetic algorithm to the problem of scheduling operations of Earth observation satellites. The adaptation uses a systematic approach to the design of the recombination operator preserving important features common to both parents. The important features are identified experimentally on the basis of correlations between the value of the objective function and the similarity of good solutions. Our results indicate that this systematic approach reduces the effort needed to design a high quality recombination operator by avoiding not promising development directions.
Article PDF
Avoid common mistakes on your manuscript.
References
Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94, 392–404 (1996)
Boese, K., Kahng, A., Muddu, S.: A new adaptive multistart technique for combinatorial global optimization. Oper. Res. Lett. 16, 101–113 (1994)
Davis, L.: Adapting operator probabilities in genetic algorithms. In: Schaffer (ed.) Proceedings of the Third International Conference on Genetic Algorithms and Their Applications Morgan Kaufmann, pp. 61–69. San Mateo, CA (1989)
Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing Vol 8 of Handbooks in Operations Research and Management Science, pp. 35-139. North-Holland, Amsterdam (1995)
Galinier, P., Hao, J.-K.: Hybrid evolutionary algorithms for graph coloring. J. Comb. Optim. 3(4), 379–397 (1999)
Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns Elements of Reusable Object-Oriented Software. Addison-Wesley (1994)
Glover, F.: Scatter search and path relinking. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 297–316. McGraw-Hill, London (1999)
Godart, J.M.: Combinatorial optimisation based decision/support system for trip planning. In: Proceedings of the 1999 International Conference on Information and Communication Technologies in Tourism Innsbrück (1999)
Homberger, J., Gehring, H.: Two evolutionary meta-heuristics for the vehicle routing problem with time windows. INFOR 37, 297–318 (1999)
Jaszkiewicz, A., Kominek, P.: Genetic local search with distance preserving recombination operator for a vehicle routing problem. Eur. J. Oper. Res. 151(2), 352–364 (2003)
Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 184–192. Morgan Kaufmann, San Francisco, CA (1995)
Kubiak, M.: Systematic construction of recombination operators for the vehicle routing problem. Foundation of Computing and Decision Sciences 29, 3 (2004)
Kuipers, E.: An algorithm for selecting and timetabling requests for an earth observation satellite. Bulletin de la Socieete Française de Recherche Operationnelle et d’Aide a la Decision 11, 7–10 (2003)
Martello, S., Toth, P.: Knapsack Problems, Algorithms and Computer Implementations. Wiley, England (1990)
Michalewicz, Z.: A hierarchy of evolution programs: an experimental Study. Evol. Comput. 1(1), 51–76 (1993)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin Heidelberg (1992)
Merz, P., Freisleben, B.: Search for the TSP: new results. In: Proceedings of the 1997 IEEE International Conference on Evolutionary Computation IEEE Press, pp. 159–164 (1997)
Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. IEEE Trans. Evol. Comput. 4(4), 337–352 (2000)
ROADEF: http://www.prism.uvsq.fr/~vdc/ROADEF/CHALLENGES/2003/. The ROADEF Challenge (2003)
Taillard, E.D.: Comparison of iterative searches for the quadratic assignment problem. Location Sci. 3, 87–105 (1995)
Toth, P., Vigo, D.: The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications (2002)
Wolpert, D.H., Macready, W.G.: No free lunch theorem for optimization. IEEE Trans. Evol. Comput. 1(1), 67–82 (1997)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jaszkiewicz, A. Distance Preserving Recombination Operator for Earth Observation Satellites Operations Scheduling. J Math Model Algor 7, 25–42 (2008). https://doi.org/10.1007/s10852-007-9071-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-007-9071-8