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žené v:
Podrobná bibliografia
Vydané v:2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) s. 722 - 729
Hlavní autori: Ryan, Kevin, Rajan, Deepak, Ahmed, Shabbir
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2016
Predmet:
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 prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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.
AbstractList 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.
Author Ryan, Kevin
Rajan, Deepak
Ahmed, Shabbir
Author_xml – sequence: 1
  givenname: Kevin
  surname: Ryan
  fullname: Ryan, Kevin
  email: kryan31@gatech.edu
  organization: Georgia Inst. of Technol., Atlanta, GA, USA
– sequence: 2
  givenname: Deepak
  surname: Rajan
  fullname: Rajan, Deepak
  email: rajan3@llnl.gov
  organization: Lawrence Livermore Nat. Lab., Livermore, CA, USA
– sequence: 3
  givenname: Shabbir
  surname: Ahmed
  fullname: Ahmed, Shabbir
  email: sahmed@isye.gatech.edu
  organization: Georgia Inst. of Technol., Atlanta, GA, USA
BookMark eNotjE1LwzAAQCPoQefOHrzkD3Tms0m8jU1nYWChiseZ5sMF1qQkVdi_16mnB-_BuwLnMUUHwA1GC4yRumvaddu9LQjC9Y9QZ2CuhMQcKURrSdAleO-MizqHBNfOpGFMJUwhRehThqjCsJuS2esyBQPbnD6yHso9bIYxpy83uDgVqKOFy3KMZp9TTJ_lVA-_TZ9O1-DC60Nx83_OwOvjw8vqqdo-b5rVclsFwtRUcY5IT7ikVtSuFxQxwYiSzvQcMWq9UX0thZTGY4s995Jp7Kn0lpje18zSGbj9-wbn3G7MYdD5uBOcKEUZ_QYNyFLV
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/IPDPSW.2016.119
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781509036820
1509036822
EndPage 729
ExternalDocumentID 7529934
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i249t-5502b2583d76eb730474298ecb5043dfc9b68788cf1d1f5f84a1f38fd2cbf64d3
IEDL.DBID RIE
ISICitedReferencesCount 14
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000391253600084&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Jun 29 18:37:30 EDT 2023
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i249t-5502b2583d76eb730474298ecb5043dfc9b68788cf1d1f5f84a1f38fd2cbf64d3
OpenAccessLink https://www.osti.gov/biblio/1321429
PageCount 8
ParticipantIDs ieee_primary_7529934
PublicationCentury 2000
PublicationDate 20160501
PublicationDateYYYYMMDD 2016-05-01
PublicationDate_xml – month: 05
  year: 2016
  text: 20160501
  day: 01
PublicationDecade 2010
PublicationTitle 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
PublicationTitleAbbrev IPDPSW
PublicationYear 2016
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.6740918
Snippet A recently proposed scenario decomposition algorithm for stochastic 0-1 programs finds an optimal solution by evaluating and removing individual solutions that...
SourceID ieee
SourceType Publisher
StartPage 722
SubjectTerms 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
Title Scenario Decomposition for 0-1 Stochastic Programs: Improvements and Asynchronous Implementation
URI https://ieeexplore.ieee.org/document/7529934
WOSCitedRecordID wos000391253600084&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH5sw4MnlU38TQ4erWubLkm9iXPoZRSquNtM0gR3MJW1E_zvfWnLRPDipaSBEnghfe97-d73AC7xLEcxtypgYRoHiRUmkBJflVWW4q7gI2maTfD5XCwWadaDq20tjDGmIZ-Zaz9s7vKLUm98qmzMJ_jzpEkf-pzztlarU-uJwnT8mE2z_MWztRhOpL_apTTeYrb3v3X2YfRTdkeyrUM5gJ5xQ3jNtXEIaEsyNZ7_3ZGsCAabJAwiktelfpNebdl_67lW1Q1pUwVN5q8i0hXktvpy2uvgItAnjSLwe1d05EbwPLt_unsIurYIwQqxUh0gpohVPBG04Mwo7u_N0KkIo5VXIyusThUTiGy1jYrITqxIZGSpsEWslWVJQQ9h4EpnjoBIZiSn0ocBOsGTKLWVGBFRJVRI44gdw9BbZ_nRKl8sO8Oc_D19Crve-C0d8AwG9XpjzmFHf9aran3RbNc3SyObWA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7MKehJZRN_m4NH65ombVNvoo4N5yhs4m4zSRPcwVTWTvC_N2nLRPDipaSBEsgjfe97-d73AC7tWcZBrIUX-UngUc2Ux7l9FVpoYq1iH7RqNhGPx2w2S9IWXK1rYZRSFflMXbthdZef5XLlUmW9OLQ_T0I3YDOkNMB1tVaj14P9pDdM79PJi-NrRXYi-dUwpfIX_d3_rbQH3Z_CO5SuXco-tJTpwOtEKmMhbY7ulWOANzQrZMNN5HsYTcpcvnGnt-y-dWyr4gbVyYIq91cgbjJ0W3wZ6ZRwLdRHlSbwe1N2ZLrw3H-Y3g28pjGCt7BoqfQsqghEEDKSxZESsbs5s26FKSmcHlmmZSIiZrGt1DjDOtSMcqwJ01kghY5oRg6gbXKjDgHxSPGYcBcISGrPIpea25iICCZ8EuDoCDpud-YftfbFvNmY47-nL2B7MH0azUfD8eMJ7DhD1OTAU2iXy5U6gy35WS6K5Xllum-L5J6f
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2016+IEEE+International+Parallel+and+Distributed+Processing+Symposium+Workshops+%28IPDPSW%29&rft.atitle=Scenario+Decomposition+for+0-1+Stochastic+Programs%3A+Improvements+and+Asynchronous+Implementation&rft.au=Ryan%2C+Kevin&rft.au=Rajan%2C+Deepak&rft.au=Ahmed%2C+Shabbir&rft.date=2016-05-01&rft.pub=IEEE&rft.spage=722&rft.epage=729&rft_id=info:doi/10.1109%2FIPDPSW.2016.119&rft.externalDocID=7529934