IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-28697-6_84.html
   My bibliography  Save this book chapter

A Time-Indexed Generalized Vehicle Routing Model for Military Aircraft Mission Planning

In: Operations Research Proceedings 2014

Author

Listed:
  • Jorne Bergh

    (KU Leuven, Campus Brussels)

  • Nils-Hassan Quttineh

    (Linköping University)

  • Torbjörn Larsson

    (Linköping University)

  • Jeroen Beliën

    (KU Leuven, Campus Brussels)

Abstract

We introduceVan den Bergh, Jorne a time-indexedQuttineh, Nils-Hassan mixed integer linear programming model for a militaryLarsson, Torbjörn aircraft missionBeliën, Jeroen planning problem, where a fleet of cooperating aircraft should attack a number of ground targets so that the expected effect is maximized. The model is a rich vehicle routing problem and the direct application of a general solver is only practical for scenarios of very moderate sizes. Therefore, a Dantzig–Wolfe decomposition and column generation approach is considered. A column here represents a specific sequence of tasks for one aircraft, and to generate columns, a longest path problem with side constraints is solved. We compare the column generation approach with the time-indexed model with respect to upper bounding quality and conclude that the Dantzig–Wolfe decomposition yields a much stronger formulation of the problem.

Suggested Citation

  • Jorne Bergh & Nils-Hassan Quttineh & Torbjörn Larsson & Jeroen Beliën, 2016. "A Time-Indexed Generalized Vehicle Routing Model for Military Aircraft Mission Planning," Operations Research Proceedings, in: Marco Lübbecke & Arie Koster & Peter Letmathe & Reinhard Madlener & Britta Peis & Grit Walther (ed.), Operations Research Proceedings 2014, edition 1, pages 605-611, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-28697-6_84
    DOI: 10.1007/978-3-319-28697-6_84
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:oprchp:978-3-319-28697-6_84. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.