a branch and cut algorithm for the pallet loading problem

a branch and cut algorithm for the pallet loading problem

ID:33934039

大小:255.29 KB

页数:29页

时间:2019-03-01

a branch and cut algorithm for the pallet loading problem_第1页
a branch and cut algorithm for the pallet loading problem_第2页
a branch and cut algorithm for the pallet loading problem_第3页
a branch and cut algorithm for the pallet loading problem_第4页
a branch and cut algorithm for the pallet loading problem_第5页
资源描述:

《a branch and cut algorithm for the pallet loading problem》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、ABranchandCutAlgorithmforthePalletLoadingProblemR.Alvarez-Valdesa,∗,F.Parre˜nob,J.M.TamaritaaUniversityofValencia,DepartmentofStatisticsandOperationsResearch,46100Burjassot,Valencia,SpainbUniversityofCastilla-LaMancha.DepartamentodeInformatica,E.PolitecnicaSuperior,CampusUniversitario,0207

2、1Albacete,SpainAbstractWeproposeabranchandcutalgorithmforthePalletLoadingProblem.The0-1formulationproposedbyBeasleyforcuttingproblemsisadaptedtotheproblem,addingnewconstraintsandnewproceduresforvariablereduction.Wethentakeadvantageoftherelationshipbetweenthisproblemandthemaximumindependent

3、setproblemtousethepartiallineardescriptionofitsassociatedpolyhedron.Finally,weexploitthespecificstructureofourproblemtodefinethesolutiongraphandtodevelopefficientseparationprocedures.WepresentcomputationalresultsforthecompletesetsCoverI(upto50boxes)andCoverII(upto100boxes).Keywords:Palletloadi

4、ng;Packing;Maximumindependentset;1IntroductionThePalletLoadingProblem(PLP)ariseswheneveridenticalrectangularboxeshavetobepackedonarectangularpallet.Thoughtheproblemisinitiallythree-dimensional,practicalconsiderationsusuallymeanthattheboxesmustbeplacedorthogonallywithrespecttotheedgesofthep

5、allet,andinlayersinwhichtheverticalorientationoftheboxesisfixed.Withtheserestrictionsthe⋆ThisworkhasbeenpartiallysupportedbytheSpanishMinistryofScienceandTechnology,DPI2002-02553∗Correspondingauthor.Emailaddresses:ramon.alvarez@uv.es(R.Alvarez-Valdes),fparreno@info-ab.uclm.es(F.Parre˜no),jo

6、se.tamarit@uv.es(J.M.Tamarit).PreprintsubmittedtoElsevierScience25thNovember2003problembecomesthetwo-dimensionalproblemofpackingalargerectangle,apallet,withthemaximumnumberofsmallidenticalrectangles,boxes.Theproblemhasmanypracticalapplicationsindistributionandlogistics.Anincreaseinthenumbe

7、rofboxeswhichcanbeshippedonapalletdirectlyleadstoadecreaseincosts.Theproblemhasthereforeattractedalotofresearchinrecentdecadesandmanyheuristicmethodshavebeendeveloped.Ontheonehand,constructivemethodsofincreasingcomplexity,fromsimplestructuresinwhichthepalletis

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

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

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