期刊文献+

多种货物一种车型轻重搭配问题简便解法研究

Study on Simple Solution to the Problem of Light and Heavy Match of Multiple Goods and One Vehicle Type
下载PDF
导出
摘要 多种货物配载问题是复杂的多目标组合优化问题,有效解简便法较少。现有智能启发式算法繁琐、求解时间长,有些方法易陷入局部最优解,影响优化程度。为了克服这些问题,把装载体积最大、重量最大、所需车辆数最少这三个目标转化为单一目标,有效运用规划解法,提出新的简便解法。新解法采取两种措施,措施一:以车辆载重和容积分别为装载货物体积与重量的权重,使装载体积最大、重量最大这两个目标函数转化为单一目标;措施二:以最优解下限车辆数为目标求解,若得可行解,则获得满意近似最优解,多数情况下为最优解,否则最优解下限加1、加2再求解,直到求出可行最优解或满意近似最优解为止。新方法借助Excel规划求解,方法简单、易于掌握、优化程度高。 Multi cargo stowage problem is a complex multi-objective combinatorial optimization problem,and there are few simple and effective solutions.The existing intelligent heuristic algorithm is cumbersome,takes a long time to solve,and some methods are easy to fall into the local optimal solution,which affects the degree of optimization.In order to overcome these problems,the three objectives of maximum loading volume,maximum weight,and minimum number of vehicles required are converted into a single objective,and a new simple solution is proposed by effectively using the planning solution.The new solution takes two measures:One is to take vehicle load and volume as the weight of the volume and weight of loaded goods,so that the two objective functions of maximum loading volume and maximum weight can be converted into a single objective;measure 2:Take the number of vehicles at the lower limit of the optimal solution as the target.If a feasible solution is obtained,a satisfactory approximate optimal solution will be obtained.In most cases,it will be the optimal solution.Otherwise,the lower limit of the optimal solution will be solved by adding 1 or 2 until a feasible optimal solution or a satisfactory approximate optimal solution is obtained.The new method is simple,easy to master and highly optimized with the help of Excel programming.
作者 贾春玉 赵永斌 张红坚 JIA Chunyu;ZHAO Yongbin;ZHANG Hongjian(Guangdong Peizheng College,Guangzhou 510830,China)
机构地区 广东培正学院
出处 《物流科技》 2023年第17期73-76,共4页 Logistics Sci-Tech
基金 广东培正学院课题项目“圆柱型货物三维装箱优化方法研究”(22PZXJYB007)。
关键词 多货物 一种车辆 配载问题 新的简便解法 multiple goods one vehicle type multi cargo stowage new simple solution
  • 相关文献

参考文献7

二级参考文献44

  • 1卜雷,尹传忠,蒲云.优化普零货物拼箱配装的遗传算法[J].交通运输工程学报,2004,4(4):84-87. 被引量:19
  • 2刘小群,马士华.基于标杆的多车多品种货物装载优化算法[J].交通运输工程学报,2007,7(1):99-105. 被引量:5
  • 3Scheithauer G. Algorithms for the container loading problem[ J ]. Operations Research Proceeding, 1991, 445-452.
  • 4Shaehnai H, Tamir T. Polynomial time approximation schemes for class-constrained packing problems[ J]. Journal of Schedu- ling, 2001, 4(6): 312-338.
  • 5Bhattacharya S, Roy R. An exact depth-first algorithm for the pallet loading problem[ J]. European Journal of Operational Re- search, 1998, 110(3): 610-625.
  • 6Berghammer R, Renter F. A linear approximation algorithm for bin packing with absolute approximation factor[ J]. Science of Computer Programming, 2003, 48 ( 1 ) : 67- 80.
  • 7Kenyon C, Remila E. A near-optimal solution to a two-dimensional cutting stock problem[ J]. Mathematics of Operations Re- search, 2000, 25 (4) : 645- 656.
  • 8Bortfeldt A, Gehring H, Mack D. A parallel tabu search algorithm for solving the container loading problem [ J]. Parallel Computing, 2003, (29) : 641-662.
  • 9Loh K H, Bruce G, Edward W. Solving the one-dimensional bin packing problem'with a weight annealing heuristic[ J]. Com- puters & Operations Research, 2006, 10 (11 ) :1-9.
  • 10Hifi M. Exact algorithms for the guillotine strip cutting/packing problem. Computers & Operations Research,1998, 25(11): 925--940.

共引文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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