IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v47y2010i2p307-333.html
   My bibliography  Save this article

Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite

Author

Listed:
  • Djamal Habet
  • Michel Vasquez
  • Yannick Vimont

Abstract

No abstract is available for this item.

Suggested Citation

  • Djamal Habet & Michel Vasquez & Yannick Vimont, 2010. "Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite," Computational Optimization and Applications, Springer, vol. 47(2), pages 307-333, October.
    • Handle: RePEc:spr:coopap:v:47:y:2010:i:2:p:307-333
    DOI: 10.1007/s10589-008-9220-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-008-9220-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-008-9220-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    2. Hall, Nicholas G. & Magazine, Michael J., 1994. "Maximizing the value of a space mission," European Journal of Operational Research, Elsevier, vol. 78(2), pages 224-241, October.
    3. Virginie Gabrel & Alain Moulet & Cécile Murat & Vangelis Paschos, 1997. "A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts," Annals of Operations Research, Springer, vol. 69(0), pages 115-134, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tangpattanakul, Panwadee & Jozefowiez, Nicolas & Lopez, Pierre, 2015. "A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite," European Journal of Operational Research, Elsevier, vol. 245(2), pages 542-554.
    2. Jang, Jinbong & Choi, Jiwoong & Bae, Hee-Jin & Choi, In-Chan, 2013. "Image collection planning for KOrea Multi-Purpose SATellite-2," European Journal of Operational Research, Elsevier, vol. 230(1), pages 190-199.
    3. Chen, Xiaoyu & Reinelt, Gerhard & Dai, Guangming & Spitz, Andreas, 2019. "A mixed integer linear programming model for multi-satellite scheduling," European Journal of Operational Research, Elsevier, vol. 275(2), pages 694-707.
    4. Wang, Xin-Wei & Chen, Zhen & Han, Chao, 2016. "Scheduling for single agile satellite, redundant targets problem using complex networks theory," Chaos, Solitons & Fractals, Elsevier, vol. 83(C), pages 125-132.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang Ye & Hu Xiaoxuan & Zhu Waiming & Jin Peng, 2018. "Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 399-420, October.
    2. Philippe Monmousseau, 2021. "Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear Model," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 846-873, December.
    3. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    4. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    5. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    6. Hernandez, Florent & Feillet, Dominique & Giroudeau, Rodolphe & Naud, Olivier, 2016. "Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 249(2), pages 551-559.
    7. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    8. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    10. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    11. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.
    12. Lixin Tang & Gongshu Wang & Zhi-Long Chen, 2014. "Integrated Charge Batching and Casting Width Selection at Baosteel," Operations Research, INFORMS, vol. 62(4), pages 772-787, August.
    13. Müller, Juliane, 2010. "Approximative solutions to the bicriterion Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 202(1), pages 223-231, April.
    14. C S Sung & W Yang, 2008. "An exact algorithm for a cross-docking supply chain network design problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(1), pages 119-136, January.
    15. Francis, Peter & Zhang, Guangming & Smilowitz, Karen, 2007. "Improved modeling and solution methods for the multi-resource routing problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1045-1059, August.
    16. Mirela Stojković & François Soumis & Jacques Desrosiers, 1998. "The Operational Airline Crew Scheduling Problem," Transportation Science, INFORMS, vol. 32(3), pages 232-245, August.
    17. Davis, Lauren B. & Sengul, Irem & Ivy, Julie S. & Brock, Luther G. & Miles, Lastella, 2014. "Scheduling food bank collections and deliveries to ensure food safety and improve access," Socio-Economic Planning Sciences, Elsevier, vol. 48(3), pages 175-188.
    18. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
    19. Dollevoet, T.A.B. & Pecin, D. & Spliet, R., 2020. "The path programming problem and a partial path relaxation," Econometric Institute Research Papers EI-2020-04, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    20. Sarac, Abdulkadir & Batta, Rajan & Rump, Christopher M., 2006. "A branch-and-price approach for operational aircraft maintenance routing," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1850-1869, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:47:y:2010:i:2:p:307-333. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.