Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation

A recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that are discovered by solving scenario subproblems. In this work, we develop an asynchronous, distributed implementation of the algorithm which...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) s. 722 - 729
Hlavní autoři: Ryan, Kevin, Rajan, Deepak, Ahmed, Shabbir
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2016
Témata:
Algorithm design and analysis
Convergence
distributed memory algorithm
Distributed processing
Electronic mail
Parallel algorithms
scenario decomposition
Synchronization
two-stage stochastic mixed-integer programming
Upper bound
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that are discovered by solving scenario subproblems. In this work, we develop an asynchronous, distributed implementation of the algorithm which has computational advantages over existing synchronous implementations of the algorithm. Improvements to both the synchronous and asynchronous algorithm are proposed. We test the results on well known stochastic 0-1 programs from the SIPLIB test library and is able to solve one previously unsolved instance from the test set.
DOI:10.1109/IPDPSW.2016.119