Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Dynamic tabu list management using the reverse elimination method
Annals of Operations Research - Special issue on Tabu search
An efficient preprocessing procedure for the multidimensional 0–1 knapsack problem
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Tabu Search
Earth Observation Satellite Management
Constraints
A Genetic Algorithm for the Multidimensional Knapsack Problem
Journal of Heuristics
Russian doll search for solving constraint optimization problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Solving the swath segment selection problem through Lagrangean relaxation
Computers and Operations Research
A logical approach to efficient Max-SAT solving
Artificial Intelligence
New inference rules for efficient Max-SAT solving
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Exploiting inference rules to compute lower bounds for MAX-SAT solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Generating optimised satellite payload operation schedules with evolutionary algorithms
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Computers and Industrial Engineering
Computational Optimization and Applications
Strong formulation for the spot 5 daily photograph scheduling problem
Journal of Combinatorial Optimization
Computers and Industrial Engineering
Mini-bucket elimination with bucket propagation
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Artificial Intelligence
Computers and Operations Research
| Hi-index | 0.00 |
The daily photograph scheduling problem of earth observation satellites such as Spot 5 consists of scheduling a subset of mono or stereo photographs from a given set of candidates to different cameras. The scheduling must maximize a profit function while satisfying a large number of constraints. In this paper, we first present a formulation of the problem as a generalized version of the well-known knapsack model, which includes large numbers of binary and ternary “logical” constraints. We then develop a tabu search algorithm which integrates some important features including an efficient neighborhood, a dynamic tabu tenure mechanism, techniques for constraint handling, intensification and diversification. Extensive experiments on a set of large and realistic benchmark instances show the effectiveness of this approach.