A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem
From MaRDI portal
Publication:5059415
DOI10.1080/0305215X.2019.1657113OpenAlexW2973081774WikidataQ113279094 ScholiaQ113279094MaRDI QIDQ5059415
Publication date: 23 December 2022
Published in: Engineering Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0305215x.2019.1657113
Related Items (2)
Optimization for cooperative task planning of heterogeneous multi-robot systems in an order picking warehouse ⋮ Another evolution of generalized differential evolution: variable number of dimensions
Uses Software
Cites Work
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite
- A two-phase scheduling method with the consideration of task clustering for Earth observing satellites
- Strong formulation for the spot 5 daily photograph scheduling problem
- A genetic algorithm for the multidimensional knapsack problem
- Upper bounds for the SPOT 5 daily photograph scheduling problem
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Upper bounds for revenue maximization in a satellite scheduling problem
- Earth observation satellite management
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Strengthened 0-1 linear formulation for the daily satellite mission planning
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- Solving the swath segment selection problem through Lagrangean relaxation
- Maximizing the value of an Earth observation satellite orbit
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
This page was built for publication: A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem
