Randomized Simplicial Approximate Stochastic Dynamic Programming for Mid-term Reservoir Optimization

Midterm reservoir management problems are often cast as stochastic dynamic programs, due to their sequential nature. Because of the well known dimensionality issue of dynamic programming, several approximate dynamic programming (ADP) techniques have been proposed to tackled these problems. In this w...

Full description

Saved in:
Bibliographic Details
Published in:International Conference on Control, Decision and Information Technologies (Online) Vol. 1; pp. 468 - 474
Main Authors: Zephyr, Luckny, Lamond, Bernard F.
Format: Conference Proceeding
Language:English
Published: IEEE 17.05.2022
Subjects:
Complexity theory
Dynamic programming
Information technology
Monte Carlo methods
Proposals
Reservoirs
Upper bound
ISSN:2576-3555
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Midterm reservoir management problems are often cast as stochastic dynamic programs, due to their sequential nature. Because of the well known dimensionality issue of dynamic programming, several approximate dynamic programming (ADP) techniques have been proposed to tackled these problems. In this work, we investigate a new ADP scheme based on a hydrid simplicial and Monte Carlo sampling strategy. Our starting point is the works [1]-[3], which proposed a simplicial decomposition scheme guided by the curvature of the value function, as estimated by local differences between lower and upper bounds. In contrast to these approaches, which store an exhaustive list of "active" simplices at each iteration, our proposals choose grid points in small random samples of simplices. Our proposal is tested on the approximation of randomly generated concave functions and mid-term reservoir management problems.
AbstractList Midterm reservoir management problems are often cast as stochastic dynamic programs, due to their sequential nature. Because of the well known dimensionality issue of dynamic programming, several approximate dynamic programming (ADP) techniques have been proposed to tackled these problems. In this work, we investigate a new ADP scheme based on a hydrid simplicial and Monte Carlo sampling strategy. Our starting point is the works [1]-[3], which proposed a simplicial decomposition scheme guided by the curvature of the value function, as estimated by local differences between lower and upper bounds. In contrast to these approaches, which store an exhaustive list of "active" simplices at each iteration, our proposals choose grid points in small random samples of simplices. Our proposal is tested on the approximation of randomly generated concave functions and mid-term reservoir management problems.
Author Lamond, Bernard F.
Zephyr, Luckny
Author_xml – sequence: 1
  givenname: Luckny
  surname: Zephyr
  fullname: Zephyr, Luckny
  email: lzephyr@laurentian.ca
  organization: Laurentian University,Faculty of Management,Sudbury,ON,Canada,P3E 2C6
– sequence: 2
  givenname: Bernard F.
  surname: Lamond
  fullname: Lamond, Bernard F.
  email: bernard.lamond@fsa.ulaval.ca
  organization: Université Laval,Department of Operations & Decision Systems,Québec,QC,Canada,G1V 0A6
BookMark eNotkN9KwzAchaMouM09gRfmBVp_SZo2uRybfwaTyTbBu5GmyYwsTUmDOJ_egrs539X5OJwxumpDaxC6J5ATAvJhHhbLHeeEk5wCpbkUUEAFF2hMypIXsoTq4xKNKK_KjHHOb9C0778AgBEJQ2GEmo1qm-Ddr2nw1vnu6LRTRzzruhh-nFfJ4G0K-lP1yWm8OLXKD3yL4RCV9649YBsifnVNlkz0eGN6E7-Di3jdJTdoVXKhvUXXVh17Mz1zgt6fHnfzl2y1fl7OZ6vMEcZSxgQ3IIUwXFta11AJDVZUWlJClWpKVROwFKxSVFstCjZkUWleG1NS3kg2QXf_XmeM2Xdx2B9P-_Mp7A_LGFvl
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CoDIT55151.2022.9804070
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Xplore Digital Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore Digital Library
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 166549607X
9781665496070
EISSN 2576-3555
EndPage 474
ExternalDocumentID 9804070
Genre orig-research
GroupedDBID 6IE
6IF
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i133t-385e0988e5cf2bb078c0f87c9212aad6ab10f20faa2cfc843cfc47c5bee625d93
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000846862800078&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:23:36 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i133t-385e0988e5cf2bb078c0f87c9212aad6ab10f20faa2cfc843cfc47c5bee625d93
PageCount 7
ParticipantIDs ieee_primary_9804070
PublicationCentury 2000
PublicationDate 2022-May-17
PublicationDateYYYYMMDD 2022-05-17
PublicationDate_xml – month: 05
  year: 2022
  text: 2022-May-17
  day: 17
PublicationDecade 2020
PublicationTitle International Conference on Control, Decision and Information Technologies (Online)
PublicationTitleAbbrev CODIT
PublicationYear 2022
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003190022
Score 1.7946738
Snippet Midterm reservoir management problems are often cast as stochastic dynamic programs, due to their sequential nature. Because of the well known dimensionality...
SourceID ieee
SourceType Publisher
StartPage 468
SubjectTerms Complexity theory
Dynamic programming
Information technology
Monte Carlo methods
Proposals
Reservoirs
Upper bound
Title Randomized Simplicial Approximate Stochastic Dynamic Programming for Mid-term Reservoir Optimization
URI https://ieeexplore.ieee.org/document/9804070
Volume 1
WOSCitedRecordID wos000846862800078&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/eLvHCXMwlV3NT8IwFG-QePCECsbv9ODRwb5K26MBiR5EIphwI10_4g5sZA5i_Ot9b0yMiRcvy9ZkXdK-9f1-75OQGw2j_cCg0T0EghIE6N-Fx0hppZyOHVeuajbBx2Mxn8tJg9zucmGstVXwme3ibeXLN7leo6msJwWIHAeCvsd5f5urtbOngCihPqpDuAJf9gb58HEGgIAhDQzDbv32rzYqlRYZtf73_UPS-UnHo5OdojkiDZsdk9Z3PwZa_55tYl5UZvJl-mkNnaZVqDhIF73DsuEfKUBTS6dlrt8U1mamw20vepwZI7SWMDUFBEufUuPheU0xKK_Y5GlBn-FcWdYJmx3yOrqfDR68uouClwL_LL1IMOtLISzTLkwSgATad4JrCUpLKdNXSeC70HdKhdppEUdwjblmibXAjYyMTkgzyzN7SigTTjIFgClifmy5UVh9UAs4qAB4APM5I21ctMVqWyhjUa_X-d_DF-QA9wVd8QG_JM2yWNsrsq83ZfpeXFe7-wW48ag5
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4QNNETKhjf7sGjhb6Wbo8GJBABiWDCjWz3EXqgNbUQ4693plSMiRcvTbtJN83udOf75knInYTRtqPQ6O4CQXEc9O_CoyekEEb6JhCmaDYRjMd8Pg8nFXK_y4XRWhfBZ7qJt4UvX6VyjaayVshB5AIg6HvM9117m621s6iAMKFGKoO4HDtsddLuYAaQgCERdN1m-f6vRiqFHunV_vcFR6Txk5BHJztVc0wqOjkhte-ODLT8QetEvYhEpav4Uys6jYtgcZAv-oCFwz9iAKeaTvNULgVWZ6bdbTd6nBljtFYwNQUMS0exsvDEphiWl23SOKPPcLKsypTNBnntPc46favso2DFwEBzy-NM2yHnmknjRhGAAmkbHsgQ1JYQqi0ixzaubYRwpZHc9-DqB5JFWgM7UqF3SqpJmugzQhk3IRMAmTxm-zpQAusPSg5HFUAP4D7npI6LtnjblspYlOt18ffwLTnoz0bDxXAwfrokh7hH6Jh3gitSzbO1vib7cpPH79lNsdNfpLargA
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%3Ajournal&rft.genre=proceeding&rft.title=International+Conference+on+Control%2C+Decision+and+Information+Technologies+%28Online%29&rft.atitle=Randomized+Simplicial+Approximate+Stochastic+Dynamic+Programming+for+Mid-term+Reservoir+Optimization&rft.au=Zephyr%2C+Luckny&rft.au=Lamond%2C+Bernard+F.&rft.date=2022-05-17&rft.pub=IEEE&rft.eissn=2576-3555&rft.volume=1&rft.spage=468&rft.epage=474&rft_id=info:doi/10.1109%2FCoDIT55151.2022.9804070&rft.externalDocID=9804070