Using an effective tabu search in interactive resources scheduling problem for LEO satellites missions

Abstract Resources scheduling in Low Earth Orbit (LEO) satellites is an important optimization problem because of the satellitesʼ specific constraints. This article addresses a scheduling problem for LEO satellites missions to assign resources which could be satellites or ground stations to the most number of requested tasks by considering the tasksʼ priority and satisfying temporal and resource constraints. In this study, first, the scheduling problem is modeled using the graph coloring theory. Then, a new tabu search (TS) algorithm is applied to solve the problem. The proposed algorithm employs a new move function to enhance the exploration ability. Accordingly, an attempt is made to compare the result of the proposed TS with some well-known optimization algorithms. The computational results denote the efficiency of the proposed algorithm, as well as its ability to find schedules that are guaranteed to be near-optimal.

[1]  Jin-Kao Hao,et al.  Hypervolume-based multi-objective local search , 2011, Neural Computing and Applications.

[2]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[3]  Wei-Cheng Lin,et al.  Daily imaging scheduling of an Earth observation satellite , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[4]  Harvey J. Greenberg,et al.  New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .

[5]  Jin-Kao Hao,et al.  A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite , 2001, Comput. Optim. Appl..

[6]  John Gasch,et al.  A Photo Album of Earth Scheduling Landsat 7 Mission Daily Activities , 1998 .

[7]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[8]  Stefan Edelkamp,et al.  Heuristic Search - Theory and Applications , 2011 .

[9]  Jin-Kao Hao,et al.  Position-Guided Tabu Search Algorithm for the Graph Coloring Problem , 2009, LION.

[10]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[11]  Zuren Feng,et al.  Guidance-solution based ant colony optimization for satellite control resource scheduling problem , 2011, Applied Intelligence.

[12]  Nicolas Zufferey,et al.  Graph colouring approaches for a satellite range scheduling problem , 2008, J. Sched..

[13]  Milind Dawande,et al.  Scheduling Support Times for Satellites with Overlapping Visibilities , 2008 .

[14]  Peter Norvig,et al.  Planning and Scheduling for Fleets of Earth Observing Satellites , 2001 .

[15]  William J. Wolfe,et al.  Three Scheduling Algorithms Applied to the Earth Observing Systems Domain , 2000 .

[16]  Victor Zaloom.  Discussion of “Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part II” , 1973 .

[17]  Aytekin Bagis.  Performance Comparison of Genetic and Tabu Search Algorithms for System Identification , 2006, KES.

[18]  Benjamin P.-C. Yen,et al.  Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties , 2002, Eur. J. Oper. Res..

[19]  L. Darrell Whitley,et al.  Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search , 2002, PPSN.

[20]  Al Globus,et al.  A Comparison of Techniques for Scheduling Earth Observing Satellites , 2004, AAAI.

[21]  Alireza Bagheri,et al.  Scheduling earth observation activities in LEO satellites using graph coloring problem , 2010, 2010 5th International Symposium on Telecommunications.

[22]  Haibo Wang,et al.  Scheduling Earth Observing Satellites with Hybrid Ant Colony Optimization Algorithm , 2009, 2009 International Conference on Artificial Intelligence and Computational Intelligence.

[23]  Holger H. Hoos,et al.  Local Search Methods , 2006, Handbook of Constraint Programming.

[24]  Donald A. Parish.  A Genetic Algorithm Approach to Automating Satellite Range Scheduling , 1994 .

[25]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

[26]  Miroslaw Malek,et al.  Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .

[27]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .

[28]  Maged M. Dessouky,et al.  A genetic algorithm approach for solving the daily photograph selection problem of the SPOT5 satellite , 2010, Comput. Ind. Eng..

[29]  Jin-Kao Hao,et al.  Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem , 2003, J. Comb. Optim..