Enabling massive parallelism for two-stage stochastic integer optimizations a branch and bound based approach

Langer, Akhil

Permalink

https://hdl.handle.net/2142/29700 Copy

Description

Title

Enabling massive parallelism for two-stage stochastic integer optimizations a branch and bound based approach

Author(s)

Langer, Akhil

Issue Date

2012-02-06T20:11:49Z

Director of Research (if dissertation) or Advisor (if thesis)

Kale, Laxmikant V.

Department of Study

Computer Science

Discipline

Computer Science

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

• High Performance Computing (HPC)
• Stochastic Optimization
• Parallel Computing
• Branch-and-bound
• Integer Programming
• Aircraft Allocation

Abstract

DoD's transportation activities incur USD 11+Billion expenditure anually. Optimal resource allocation under uncertainty provides huge opportunity for improvement and commensurate cost savings. Stochastic optimization techniques are used to incorporate uncertainty in the data to arrive at robust resource allocations. The application of stochastic optimization extends to a broad range of areas ranging from finance to production to economics to energy systems planning. We study the DoD Air Mobility Command's airfleet assignment problem that schedules 1300+ aircrafts to deal with combat delivery, strategic airlift, air refueling, aeromedical evacuation operations, etc. around the world. Our formulation of the airfleet allocation problem for a smaller time horizon shows that annual average cost benefits of 3\% can be obtained by using stochastic integer optimization. Despite the potential cost benefits, use of stochastic integer optimization has remained intractable because the computational complexity of the problem prevents rapid decisions. Modern supercomputers can attain performance of several petaflops and hence can enhance solution tractability for use in a highly dynamic decision environment. We start with a conventional parallel decomposition of the problem, analyze the challenges and address a number of performance optimizations like cut retirement and scenario clustering. We then present results from a novel branch-and-bound based design that converges to an optimal integer allocation for large problems while allowing evaluation of tens of thousands of possible scenarios. We believe that this is an interesting and uncommon approach to harnessing tera/petascale compute power for such problems without decomposing the linear programs further.

Graduation Semester

2011-12

Permalink

http://hdl.handle.net/2142/29700

Copyright and License Information

Copyright 2011 Akhil Langer

Owning Collections