期刊文献+

基于分支定价算法的异质品装箱问题研究 被引量:4

Branch-and-price algorithm for bin packing problem with heterogeneous items
原文传递
导出
摘要 在多物品物流系统中,异质品的装载运输往往会造成物品损坏、管理困难等问题.针对这种场景,本文提出了异质品装箱问题的0-1二次规划,并根据Dantzig-Wolfe分解,设计了变邻域搜索算法与分支定价算法来进行求解.实验验证了异质品装箱方案相比两种传统装箱方案的优越性,新方案兼顾了经济性和灵活性.在180个随机对比算例上,两种算法都展现了较好的性能:变邻域搜索算法的Gap值平均为1.8%,运算时间平均为1.06秒;分支定价算法则分别为0.30%和815.40秒,性能超过了Gurobi求解器.最后,本文通过引入“决策者对异质品的容忍度”这一参数,供决策者在装箱成本与异质性惩罚之间寻求一个平衡点.相较已有研究,该方案更加精细、合理,可为企业提供科学的决策依据. In multi-item logistics systems,loading and transportation of heterogeneous items can often cause damaged items,management difficulties,etc.For such an application scenario,this paper proposes a binary quadratic program for the bin packing problem with heterogeneous items.Based on Dantzig-Wolfe decomposition,a branch-and-price algorithm and a variable neighborhood search are designed.Compared with two traditional bin packing schemes,the superiority of the new bin packing scheme with heterogeneous items is verified by experiments.The new scheme takes both economy and flexibility into account.Both two proposed algorithms show competent performance on 180 randomized numerical instances.The average gap of variable neighborhood search is 1.8%and the average computing time is 1.06 seconds;those of the branch-and-price is 0.30%and 815.40 seconds respectively,which outperforms the commercial solver Gurobi.Finally,this paper,through introducing“the tolerance to heterogeneity”,provides a trade-off solution between bin-minimizing objective and penalty-minimizing objective for a decision maker.Compared with the existing solution method,our trade-off solution is more elaborate and reasonable,providing a scientific decision support for enterprises.
作者 王思睿 王林 刘瑞 曾宇容 WANG Sirui;WANG Lin;LIU Rui;ZENG Yurong(School of Information and Safety Engineering,Zhongnan University of Economics and Law,Wuhan 430073,China;School of Management,Huazhong University of Science and Technology,Wuhan 430074,China;College of Management,Shenzhen University,Shenzhen 518060,China;School of Information Engineering,Hubei University of Economics,Wuhan 430205,China)
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2023年第10期3040-3057,共18页 Systems Engineering-Theory & Practice
基金 国家社会科学基金重大项目(20&ZD126)。
关键词 异质品 装箱问题 0-1二次规划 分支定价算法 分支切割算法 heterogenous items bin packing problem binary quadratic programming branchand-price branch-and-cut
作者简介 王思睿(1994-),男,湖北罗田人,博士,讲师,研究方向:物流系统工程,E-mail:ruisiwang@foxmail.com;王林(1974-),男,湖北枣阳人,博士,教授,研究方向:管理系统工程,E-mail:wanglin@hust.edu.cn;刘瑞(1990-),男,天津静海人,博士,副研究员,研究方向:管理系统工程,E-mail:rliuhust316@gmail.com;通信作者:曾宇容(1976-),女,湖北武汉人,博士,教授,研究方向:管理系统工程,E-mail:zyr@hbue.edu.cn.
  • 相关文献

参考文献8

二级参考文献59

  • 1潘全,郭鸣,林鹏.基于MapReduce的最大团算法[J].系统工程理论与实践,2011,31(S2):150-153. 被引量:5
  • 2Wascher G, HauBner H , Schumann H. An improved typology of cutting and packing problems [ J ]. European Journal ofOperational Research, 2007 , 183(3) : 1109-1130.
  • 3Zhu W B, Zhang Z Y, Oon W C, Lim A. Space defragmentation for packing problems[ J]. European Journal of OperationalResearch, 2012, 222(3) : 452-462.
  • 4Lin Y H, Lin C,Lin B. On conflict and cooperation in a two-echelon inventory model for deteriorating items[ J]. Computers& Industrial Engineering, 2010, 59(4) : 703-711.
  • 5Jansen K, An approximation scheme for bin packing with conflicts[ J]. Journal of Combinational Optimization, 1999,3(4):363-377.
  • 6Gendreau M , Laporte G, Semet F. Heuristics and lower bounds for the bin packing problem with conflicts[ J]. Computers &Operations Research, 2004, 31(3) : 347-358.
  • 7Muritiba A E F,Iori M,Malaguti E, Toth P. Algorithms for the bin packing problem with conflicts[ J]. INFORMS Journal onComputing, 2010,22(3) : 401-415.
  • 8Khanafer A,Clautiaux F, Talbi E. New lower bounds for bin packing problems with conflicts [ J ]. European Journal of Opera-tional Research, 2010 , 206 ( 2 ) : 281-288.
  • 9Elhedhli S, Li L Z, Gzara M , Naoum-sawaya J. A branch-and-price algorithm for the bin packing problem with conflicts[ J].INFORMS Journal on Computing, 2011,22(3) : 404-415.
  • 10Galinier P, Hertz A. A survey of local search methods for graph coloring[ J]. Computers & Operations Research, 2006 , 33(9) : 2547-2562.

共引文献113

同被引文献54

引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部