Background Image
Previous Page  260 / 552 Next Page
Information
Show Menu
Previous Page 260 / 552 Next Page
Page Background

INFORMS Philadelphia – 2015

258

Tuesday, 8:00am - 9:30am

TA01

01-Room 301, Marriott

Military Manpower and Force Management

Sponsor: Military Applications

Sponsored Session

Chair: Andrew Hall, COL, U.S. Army, 4760 40th St N, Arlington, VA,

United States of America,

AndrewOscarH@aol.com

1 - Air Force Officer Accession Planning: Addressing Key Gaps in

Meeting Career Field Academic Degree Requirements

Tara Terry, Operations Researcher, RAND Corporation, 1200 S.

Hayes St., Arlington, VA, 22202, United States of America,

tterry@rand.org

The goal of the Air Force officer accession process is to ensure the USAF accesses

officers with the knowledge, skills and attributes to perform missions in particular

career fields. Key to this goal for non-rated officers is establishing and enforcing

academic degree requirements. We uncovered gaps in accession processes that

undermine meeting career field education requirements. We introduced

recommendations toward correcting the accession process and meeting career

fields academic needs.

2 - A Methodology for Estimating Caseload in the U.S. Army’s

Disability Rating Process

James Broyles, Operations Researcher, RAND Corporation, 1776

Main Street, Santa Monica, CA, 90401, United States of America,

jbroyles@rand.org,

Mustafa Oguz

As U.S. Army soldiers separate from service, a portion of them enter the disability

rating process to obtain a rating that determines their level of benefits and

compensation. The process involves several evaluation steps and appeal processes

that cause highly variable and sometimes long processing durations. This research

presents a methodology that uses a non-Markovian probability model for

estimating disability rating caseload given forecasted future soldier separations.

3 - Aligning Officer Personnel Requirements with a Sustainable

Career Lifecycle Model

Michael Needham, DCS G-1, HQDA, 300 Army Pentagon,

Washington, DC, United States of America,

michael.p.needham2.mil@mail.mil

The U.S. Army is at a critical juncture in determining a supportable military

personnel structure that is limited by mandated force structures. Personnel

structure adjustments drive near-term force-shaping personnel policies, such as

accessions, promotions, and separations. We identify sustainable standards of

grade using historical data while accounting for future personnel management

policies. The model uses sixteen years of historical data as a foundation to

determine future behavior.

4 - Army Officer Grade Distribution for the Army

Competitive Category

Francisco Baez, DCS G-1, HQDA, 300 Army Pentagon,

Washington, DC, United States of America,

francisco.r.baez.mil@mail.mil

The Army’s Grade Structure has become significantly senior impacting the

potential health of the current and future force by reducing selectivity and

competition rates, and forcing early promotions. The propose distribution of

officers focuses on re-balancing grade structure for each career management field

to ensure balance and health of the force by ensuring leader-to-led ratios, quality,

and viable career paths for all soldiers.

TA02

02-Room 302, Marriott

Optimization Applications in Homeland Security

Cluster: Homeland Security

Invited Session

Chair: Daniel Faissol, Lawrence Livermore National Laboratory,

Livermore, CA, United States of America,

faissol1@llnl.gov

1 - Modeling the Global Spread and Impact of Diseases at Various

Levels of Aggregation

Daniel Skorski, Operations Research Scientist, Pacific Northwest

National Laboratory, 301 Hills Street, Richland, WA, 99352,

United States of America,

Daniel.Skorski@pnnl.gov,

Robert Brigantic, Brent Daniel, Matthew Oster

Diseases spread by various modes of transportation is a never-ending modeling

and analysis need. GlobalCURE provides a framework to study the interplay

between global infrastructure, epidemiology, economics, government policy, and

regional and/or international populations. This presentation summarizes the

development (web and desktop) and use of the GlobalCURE tool. In our analysis,

we specifically focus on the interplay of factors across levels of aggregation (e.g.,

tract through country).

2 - Optimization Planning Tool for Urban Search Missions

Daniel Faissol, Lawrence Livermore National Laboratory,

Livermore, CA, United States of America,

faissol1@llnl.gov

,

Claudio Santiago, Richard Wheeler, Thomas Edmunds

We present a prototype tool to support planning of radiological and nuclear

search missions in an urban environment using mobile detectors. Two distinct

problems are considered with proposed solutions: (1) a nonconvex optimization

problem that solves for detector dwell times and locations that maximize the

probability of detection for building interiors, and (2) a multiple vehicle routing

problem on a directed multigraph that solves for the maximum net benefit given

a fixed total search time.

3 - Optimal Sonar Deployment in a Maritime Environment:

A Fortification Approach

Taofeek Biobaku, University of Houston, Houston, TX,

United States of America,

tobiobaku@uh.edu

, Gino Lim,

Jaeyoung Cho, Hamid Parsaei, Seon Jin Kim

The safety and integrity of maritime assets continue to be of paramount

importance in world trade and economy. The marine-based trilevel problem

remains computationally challenging. The inherent challenges increase with the

risk analysis approach we adopt. We propose algorithms based on modifications of

Benders’ decomposition; and column-and- constraint general algorithms to

attempt an optimal solution. Thereafter, we compare solutions on these two

algorithms using a case study.

4 - A Mothership-based UAV Routing Problem in Support of

Counterfire Operations

Jaeyoung Cho, University of Houston, 333 Dominion Dr.,

#1021, Katy, TX, 77450, United States of America,

uncmac.rokag@gmail.com

, Taofeek Biobaku, Seon Jin Kim,

Gino Lim

We describe a model for routing UAVs which are launched and recovered from

airborne drone carriers. We formulate and solve this problem with a given fleet of

UAVs subject to technical and operational constraints. The spatio-temporal model

captures important aspects of a UAV deployment in counterfire operations

including collaboration tactics and overlapping observation. The model is

designed to provide an insight into issues associated with operating UAVs aided

counterfire operations system.

TA03

03-Room 303, Marriott

Scheduling in Practice

Cluster: Scheduling and Project Management

Invited Session

Chair: Emrah Cimren, Nike, 1 SW Bowerman Dr., Beaverton, OR,

97005, United States of America,

Emrah.Cimren@nike.com

1 - A Sample-Gradient-Based Algorithm for Multiple-OR and PACU

Surgery Scheduling

Miao Bai, Lehigh University, 200 W Packer Ave, Bethlehem, PA,

18015, United States of America,

mib411@lehigh.edu

,

Gregory Tonkay, Robert Storer

We address a multiple-OR surgery scheduling problem constrained by shared

PACU capacity within the block-booking framework. Given the surgery sequence,

a Discrete Event Dynamic System-based stochastic optimization model is

formulated in order to minimize the cost incurred by patient waiting time,

surgeon idle time, OR blocking time, OR overtime and PACU overtime. A sample-

gradient-based algorithm is proposed to solve the sample average approximation

of our formulation.

2 - Leveraging Predictive Analytics for HPC Scheduling in

Dynamic Environments

Sarah Powers, Oak Ridge National Laboratory, One Bethel Valley

Road, Oak Ridge, TN, United States of America,

powersss@ornl.gov

Improvements in heterogeneous HPC scheduling can be obtained by leveraging

predictive analytics of job submissions. Development of the necessary workflow

models requires historical data and is costly due to the potential high diversity of

job types and their evolving patterns over time. We propose a method which

learns these patterns dynamically, allowing for unknown jobs types and changing

arrival patterns. Prediction gains are thus automated and utilizable in dynamic

environments.

TA01