Multiobjective planning for naval mine counter measures missions

Casey D. Trail, Mendel D. Schmiedekamp, Shashi Phoha, John Phillip Sustersic, Jr.

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Near-optimal scheduling and allocation for DoD missions is complicated by many factors, including multiple measures of effectiveness, mixed-initiatives, heterogeneity of systems and non-uniformity of homogenous systems; these factors contribute to a complex planning problem with non-linear, combinatorial, and continuous components that is further complicated by information uncertainty. In Navy, mine counter measure missions, planning entails components of the vehicle routing problem with time windows and flexible flowshop scheduling with pre-emptive maintenance. We present a multiobjective mine counter measures problem formulation and describe the non-dominated scheduler, a scheduling programme that parametrically explores continuous dimensions of the decision space, stochastically samples from exponentially large decision spaces, and uses surrogate metrics to bound computational complexity. This provides mission commander with a non-dominated set of alternative plans. This scheduler has been integrated into existing tools and is being evaluated by the US Navy for extension and integration into next-generation mine warfare decision aids.

Original languageEnglish (US)
Pages (from-to)113-135
Number of pages23
JournalInternational Journal of Operational Research
Volume16
Issue number1
DOIs
StatePublished - Jan 1 2013

Fingerprint

Planning
Countermeasures
Navy
Factors
Computational complexity
Time windows
Measures of effectiveness
Integrated
Vehicle routing problem
Decision aids
Warfare
Flow shop scheduling
Problem formulation
Information uncertainty

All Science Journal Classification (ASJC) codes

  • Management Science and Operations Research

Cite this

@article{8927729d1dc04182834532de613f1f95,
title = "Multiobjective planning for naval mine counter measures missions",
abstract = "Near-optimal scheduling and allocation for DoD missions is complicated by many factors, including multiple measures of effectiveness, mixed-initiatives, heterogeneity of systems and non-uniformity of homogenous systems; these factors contribute to a complex planning problem with non-linear, combinatorial, and continuous components that is further complicated by information uncertainty. In Navy, mine counter measure missions, planning entails components of the vehicle routing problem with time windows and flexible flowshop scheduling with pre-emptive maintenance. We present a multiobjective mine counter measures problem formulation and describe the non-dominated scheduler, a scheduling programme that parametrically explores continuous dimensions of the decision space, stochastically samples from exponentially large decision spaces, and uses surrogate metrics to bound computational complexity. This provides mission commander with a non-dominated set of alternative plans. This scheduler has been integrated into existing tools and is being evaluated by the US Navy for extension and integration into next-generation mine warfare decision aids.",
author = "Trail, {Casey D.} and Schmiedekamp, {Mendel D.} and Shashi Phoha and {Sustersic, Jr.}, {John Phillip}",
year = "2013",
month = "1",
day = "1",
doi = "10.1504/IJOR.2013.050626",
language = "English (US)",
volume = "16",
pages = "113--135",
journal = "International Journal of Operational Research",
issn = "1745-7645",
publisher = "Inderscience Enterprises Ltd",
number = "1",

}

Multiobjective planning for naval mine counter measures missions. / Trail, Casey D.; Schmiedekamp, Mendel D.; Phoha, Shashi; Sustersic, Jr., John Phillip.

In: International Journal of Operational Research, Vol. 16, No. 1, 01.01.2013, p. 113-135.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Multiobjective planning for naval mine counter measures missions

AU - Trail, Casey D.

AU - Schmiedekamp, Mendel D.

AU - Phoha, Shashi

AU - Sustersic, Jr., John Phillip

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Near-optimal scheduling and allocation for DoD missions is complicated by many factors, including multiple measures of effectiveness, mixed-initiatives, heterogeneity of systems and non-uniformity of homogenous systems; these factors contribute to a complex planning problem with non-linear, combinatorial, and continuous components that is further complicated by information uncertainty. In Navy, mine counter measure missions, planning entails components of the vehicle routing problem with time windows and flexible flowshop scheduling with pre-emptive maintenance. We present a multiobjective mine counter measures problem formulation and describe the non-dominated scheduler, a scheduling programme that parametrically explores continuous dimensions of the decision space, stochastically samples from exponentially large decision spaces, and uses surrogate metrics to bound computational complexity. This provides mission commander with a non-dominated set of alternative plans. This scheduler has been integrated into existing tools and is being evaluated by the US Navy for extension and integration into next-generation mine warfare decision aids.

AB - Near-optimal scheduling and allocation for DoD missions is complicated by many factors, including multiple measures of effectiveness, mixed-initiatives, heterogeneity of systems and non-uniformity of homogenous systems; these factors contribute to a complex planning problem with non-linear, combinatorial, and continuous components that is further complicated by information uncertainty. In Navy, mine counter measure missions, planning entails components of the vehicle routing problem with time windows and flexible flowshop scheduling with pre-emptive maintenance. We present a multiobjective mine counter measures problem formulation and describe the non-dominated scheduler, a scheduling programme that parametrically explores continuous dimensions of the decision space, stochastically samples from exponentially large decision spaces, and uses surrogate metrics to bound computational complexity. This provides mission commander with a non-dominated set of alternative plans. This scheduler has been integrated into existing tools and is being evaluated by the US Navy for extension and integration into next-generation mine warfare decision aids.

UR - http://www.scopus.com/inward/record.url?scp=84870716261&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870716261&partnerID=8YFLogxK

U2 - 10.1504/IJOR.2013.050626

DO - 10.1504/IJOR.2013.050626

M3 - Article

VL - 16

SP - 113

EP - 135

JO - International Journal of Operational Research

JF - International Journal of Operational Research

SN - 1745-7645

IS - 1

ER -