liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Military aircraft mission planning: a generalized vehicle routing model with synchronization and precedence
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0002-9881-4170
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0003-2094-7376
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0001-5907-008
2013 (English)In: EURO Journal on Transportation and Logistics, ISSN 2192-4376, E-ISSN 2192-4384, Vol. 2, no 1-2, 109-127 p.Article in journal (Refereed) Published
Abstract [en]

We introduce a military aircraft mission planning problem where agiven fleet of aircraft should attack a number of ground targets. Due to the nature of the attack, two aircraft need to rendez-vous at the target, that is, they need to be synchronized in both space and time. At the attack, one aircraft is launching a guided weapon, while the other is illuminating the target. Each target is associated with multiple attack and illumination options. Further, there may be precedence constraints between targets, limiting the order of the attacks. The objective is to maximize the outcome of the entire attack, while also minimizing the mission timespan. We give a linear mixed integer programming model of the problem, which can be characterized as ageneralized vehicle routing problem with synchronization and precedence side constraints. Numerical results are presented for problem instances of realistic size.

Place, publisher, year, edition, pages
Springer, 2013. Vol. 2, no 1-2, 109-127 p.
Keyword [en]
Military Operations Research, Generalized vehicle routing, Mixed integer programming, Time dependencies, Precedence constraints
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-104598DOI: 10.1007/s13676-013-0023-3OAI: oai:DiVA.org:liu-104598DiVA: diva2:697916
Available from: 2014-02-19 Created: 2014-02-19 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Quttineh, Nils-HassanLarsson, TorbjörnLundberg, KristianHolmberg, Kaj

Search in DiVA

By author/editor
Quttineh, Nils-HassanLarsson, TorbjörnLundberg, KristianHolmberg, Kaj
By organisation
Optimization The Institute of Technology
In the same journal
EURO Journal on Transportation and Logistics
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 150 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf