rollout algorithms for combinatorial optimizationnew

rollout algorithms for combinatorial optimizationnew

ID:34372815

大小:714.71 KB

页数:20页

时间:2019-03-05

rollout algorithms for combinatorial optimizationnew_第1页
rollout algorithms for combinatorial optimizationnew_第2页
rollout algorithms for combinatorial optimizationnew_第3页
rollout algorithms for combinatorial optimizationnew_第4页
rollout algorithms for combinatorial optimizationnew_第5页
资源描述:

《rollout algorithms for combinatorial optimizationnew》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、APRIL1997LIDS-P-2386REVISEDJUNE1997ROLLOUTALGORITHMSFORCOMBINATORIALOPTIMIZATION1byDimitriP.Bertsekas,JohnN.Tsitsiklis,andCynaraWu2AbstractWeconsidertheapproximatesolutionofdiscreteoptimizationproblemsusingproceduresthatarecapableofmagnifyingtheeffectivenessofanygivenheuristicalgori

2、thmthroughsequen-tialapplication.Inparticular,weembedtheproblemwithinadynamicprogrammingframework,andweintroduceseveraltypesofrolloutalgorithms,whicharerelatedtonotionsofpolicyiter-ation.Weprovideconditionsguaranteeingthattherolloutalgorithmimprovestheperformanceoftheoriginalheuris

3、ticalgorithm.Themethodisillustratedinthecontextofamachinemain-tenanceandrepairproblem.1ResearchsupportedbyNSFunderGrantDMI-9625489.2Dept.ofElectricalEngineeringandComputerScience,M.I.T.,Cambridge,Mass.,02139.11.Introduction1.INTRODUCTIONWediscusstheapproximatesolutionofbroadclasses

4、ofcombinatorialoptimizationproblemsbyembeddingthemwithinaDynamicProgrammingframework(DPforshort).Thekeyideaistoemployagivenheuristicintheconstructionofanoptimalcost-to-gofunctionapproximation,whichisthenusedinthespiritoftheNeuro-DynamicProgramming/ReinforcementLearningmethodology(N

5、DPforshort;see[BBS95],[BeT96]forbroaddiscussionsofthismethodology).Inthenextsection,wewillintroduceageneralgraphsearchproblemthatwillserveasthecontextofourmethodology.Toillustratetheideasinvolved,however,letusconsiderthefollowingtypeofproblem,whichincludesasspecialcasesproblemssuch

6、asshortestpath,assignment,scheduling,matching,etc.TheproblemischaracterizedbyafinitesetUoffeasiblesolutions,andbyacostfunctiong(u).EachsolutionuhasNcomponents;thatis,ithastheformu=(u1,u2,...,uN),whereNisapositiveinteger.Wewanttofindasolutionu∈Uthatminimizesg(u).Wecanviewtheprecedingp

7、roblemasasequentialdecisionproblem,wherebythecom-ponentsu1,...,uNareselectedone-at-a-time.Ann-tuple(u1,...,un)consistingofthefirstncomponentsofasolutioniscalledann-solution.Weassociaten-solutionswiththenthstageofaDPproblem.Inparticular,forn=1,...,N,thestatesofthenthstageareoftheform

8、(u1,...,un).Theinitialstat

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。