1988 An algorithm for solving large capacitated warehouse location problems

1988 An algorithm for solving large capacitated warehouse location problems

ID:39150987

大小:816.85 KB

页数:12页

时间:2019-06-25

1988 An algorithm for solving large capacitated warehouse location problems_第1页
1988 An algorithm for solving large capacitated warehouse location problems_第2页
1988 An algorithm for solving large capacitated warehouse location problems_第3页
1988 An algorithm for solving large capacitated warehouse location problems_第4页
1988 An algorithm for solving large capacitated warehouse location problems_第5页
资源描述:

《1988 An algorithm for solving large capacitated warehouse location problems》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、314EuropeanJournalofOperationalResearch33(1988)314-325North-HollandAnalgorithmforsolvinglargecapacitatedwarehouselocationproblemsJ.E.BEASLEYDepartmentofManagementScience,ImperialCollege,LondonSW72BX,EnglandAbstract:Inthispaperwepresentalowerboundforthecapacitatedwar

2、ehouselocationproblembaseduponlagrangeanrelaxationofamixed-integerformulationoftheproblem.Feasiblesolutionexclusionconstraintsareusedtogetherwithproblemreductiontestsderivedfromboththeoriginalproblemandthelagrangeanrelaxation.Byincorporatingthelowerboundandthereduct

3、iontestsintoatreesearchprocedureweareabletosolveproblemsinvolvingupto500potentialwarehouselocationsand1000customers.Keyword:Location1.Introduction1.1.LiteraturesurveyThecapacitatedwarehouselocationproblemInourpreviouspaper[10]webrieflyreviewed(henceforthdenotedbyCWL

4、P)istheproblemoftheliteraturerelatingtoCWLPandso,forrea-locatinganumberofwarehouseswhichhavetosonsofspace,weshallonlydealherewithpapersserviceasetofcustomers,atminimumcost,whereadditionaltothosediscussedin[10].eachcustomerhasanassociateddemandandthereBartezzaghi,Col

5、orniandPalermo[7]presentedareconstraintsonthetotaldemandthatcanbeatreesearchalgorithmbaseduponalowerboundmetfromawarehouse.derivedfromatransportationproblemandgaveInthispaperwepresentanalgorithmbasedcomputationalresultsforproblemsinvolvingupuponlagrangeanrelaxationo

6、famixed-integerfor-to12potentialwarehouselocationsand40mulationoftheproblem.Inapreviouspaper[10]customers.wepresentedanalgorithmwhichwasalsobasedBitran,Chandru,SempolinskiandShapiro[8]uponlagrangeanrelaxationofamixed-integerfor-appliedatechniquecalledinverseoptimisa

7、tiontomulationoftheproblem.Themaindifferencestheproblemandpresentedcomputationalresultsbetweenthispaperandourpreviouspaper[10]forproblemsinvolvingupto10potentialare:warehouselocationsand20customers.(a)adifferentmixed-integerformulationoftheBaker[3]presentedatheoreti

8、calanalysisre-problemlatedtostrengtheningthelinearprogrammingre-(b)theuseoffeasiblesolutionexclusioncon-laxationofamixed-integerformulatio

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

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

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