Benckmark inctances of the (SPOT5) daily photograph scheduling problem

This dataset includes the 21 benchmark instances of the (SPOT5) daily photograph scheduling problem (DCKP). These instances were designed by a CNES (French National Space Agency) simulator of the SPOT5 order book [1]. Please see the README file for more details about these instances. We would like to thank Dr. Vasquez Michel [2] for sharing these instances. These 21 real-life DPSP benchmark instances also can be solved by our algorithm proposed for the disjunctively constrained knapsack problem (DCKP) [3].

[1] Bensana E, Lemaitre M, Verfaillie G. Earth observation satellite management[J]. Constraints, 1999, 4(3): 293-299.
[2] Vasquez M, Hao J K. A “logic-constrained” knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite[J]. Computational optimization and applications, 2001, 20(2): 137-157.
[3] Zequn WEI, Jin-Kao HAO. A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. Computers & Operations Research, Revision, April, 2021.