Journal ArticleDOI
A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite
Michel Vasquez,Jin-Kao Hao +1 more
TLDR
This paper develops 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, and large numbers of binary and ternary “logical” constraints.Abstract:
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.read more
Citations
More filters
Proceedings ArticleDOI
Chaff: engineering an efficient SAT solver
TL;DR: The development of a new complete solver, Chaff, is described which achieves significant performance gains through careful engineering of all aspects of the search-especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel low overhead decision strategy.
Proceedings ArticleDOI
Efficient conflict driven learning in a boolean satisfiability solver
TL;DR: This paper generalizes various conflict driven learning strategies in terms of different partitioning schemes of the implication graph to re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes.
Journal ArticleDOI
The multidimensional 0–1 knapsack problem: An overview
TL;DR: This paper surveys the main results of the multidimensional 0–1 knapsack problem and focuses on the theoretical properties as well as approximate or exact solutions of this special 0-1 program.
Journal ArticleDOI
Selecting and scheduling observations of agile satellites
TL;DR: In this article, the authors discuss the problem of managing the new generation of Agile Earth Observing Satellites (AEOS) and present different methods which have been investigated in order to solve a simplified version of the complete problem.
Journal ArticleDOI
Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
TL;DR: A fast and simple priority dispatch method is described and shown to produce acceptable schedules most of the time and a look ahead algorithm is introduced that outperforms the dispatcher by about 12% with only a small increase in run time.
References
More filters
Book
Tabu Search
Fred Glover,Manuel Laguna +1 more
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Book
Knapsack Problems: Algorithms and Computer Implementations
Silvano Martello,Paolo Toth +1 more
TL;DR: This paper focuses on the part of the knapsack problem where the problem of bin packing is concerned and investigates the role of computer codes in the solution of this problem.
Journal ArticleDOI
A Genetic Algorithm for the Multidimensional Knapsack Problem
P. C. Chu,John E. Beasley +1 more
TL;DR: A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach and is capable of obtaining high-quality solutions for problems of various characteristics.
Book ChapterDOI
Critical Event Tabu Search for Multidimensional Knapsack Problems
Fred Glover,Gary A. Kochenberger +1 more
TL;DR: A new approach to creating a tabu search method whose underlying memory mechanisms are organized around “critical events” is reported, which performs more effectively than previous heuristics for multidimensional knapsack problems.