1993 Lagrangean heuristics for location problems

1993 Lagrangean heuristics for location problems

ID:39150954

大小:974.90 KB

页数:17页

时间:2019-06-25

1993 Lagrangean heuristics for location problems_第1页
1993 Lagrangean heuristics for location problems_第2页
1993 Lagrangean heuristics for location problems_第3页
1993 Lagrangean heuristics for location problems_第4页
1993 Lagrangean heuristics for location problems_第5页
资源描述:

《1993 Lagrangean heuristics for location problems》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、EuropeanJournalofOperationalResearch65(1993)383-399383North-HollandTheoryandMethodologyLagrangeanheuristicsforlocationproblemsJ.E.BeasleyTheManagementSchool,ImperialCollege,LondonSW72AZ,England,UKReceivedSeptember1988;revisedMarch1991Abstract:InthispaperwepresentaframeworkfordevelopingLagrangeanhe

2、uristics(heuristicsbaseduponLagrangeanrelaxationandsubgradientoptimisation)withrespecttolocationproblems.Computa-tionalresultsaregivenforfourdifferentlocationproblems:p-median,uncapacitatedwarehouselocation,capacitatedwarehouselocationandcapacitatedwarehouselocationwithsinglesourcecon-straints.The

3、seresultsindicatethattheframeworkpresentedinthispaperisrobust,i.e.itgivesgoodqualitysolutionsforeachofthesedifferentlocationproblems.Keywords:Lagrangeanheuristic;LocationI.IntroductionAlowerboundfortheaboveprogramcanbefoundbyintroducingaLagrangemultiplierma-Itiswell-knownthatinrecentyearsapopulart

4、rixs(>0)for(2)togettheLagrangeanlowertechniquefortheoptimalsolutionofstructuredboundprogram(LLBP)givenby:pure(ormixed)zero-oneintegerprogramshasbeentheuseoftreesearchprocedureswithminimise(c-sA)x+sb(4)boundstocurtailthesearchbeingfoundviasubjecttox~(0,1).(5)Lagrangeanrelaxationandsubgradientoptimi

5、sa-ItisclearthatLLBPcanbeeasilysolvedtotion(e.g.seeFisher[26,27]).giveasolutionXwithacorrespondinglowerLagrangeanrelaxationandsubgradientoptimi-boundgivenby(c-sA)X+sb.Applyingsubgra-sationcanalsobeusedhowever,inaverysimilardientoptimisation(aniterativeprocedure)gener-manner,toproduceeffectiveheuri

6、sticalgorithmsatesasequenceofLagrangemultipliersinan(lagrangeanheuristics).attempttomaximisethelowerboundobtainedInordertoillustratetheconceptofaLa-fromLLBP.grangeanheuristicconsiderthefollowinggeneralThebasicideabehindaLagrangeanheuristiczero-oneintegerprogram(expressedinmatrixisthattheinformatio

7、ncontainedinLLBPatnotation):eachsubgradientiterationcanbeusedinanminimisecx(1)attempttoconstructafeasiblesolutiontothesubjecttoAx>b,(2)originalproblem(equations(1)-(3)above).Forexample,thesolutionXtoLLBPmayx~(0,a

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

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

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