期刊文献+

线性下料问题模型的建立与改进

Establishment and Improvement of Material Problem under Linear Model
下载PDF
导出
摘要 从实际的线性下料出发,利用整数规划模型,给出使企业浪费原料最少,同时兼顾企业生产能力的通用下料模型;关键的是还提出了改进的下料模型,改进的模型考虑到切割种类所带来的费用.这个模型的计算只需借助lingo软件,大大地减少了线性下料问题的复杂性,并降低了生产成本. In this paper,from a practical linear material,using integer programing model,it makes the enterprise waste least materials while taking into account the general production capacity of enterprises under the mixture model;the key is to improve material under the improved model.The improved model considers cutting costs brought about by the cutting species.This model of computation using the lingo software,greatly reduces the complexity of linear matenial problem,and reduces the production cost.
作者 邹腊英
出处 《兰州文理学院学报(自然科学版)》 2015年第2期32-34,共3页 Journal of Lanzhou University of Arts and Science(Natural Sciences)
关键词 线性下料 整数规划 下料方式 lingo软件 降低成本 linear material integer programming lingo software reduce the cost
  • 相关文献

参考文献5

  • 1范玉妹,徐尔,赵金玲,等.数学规划及其应用[M].北京:冶金工业出版社,2009.
  • 2张春玲,崔耀东.一维优化下料问题[J].桂林工学院学报,2004,24(1):103-106. 被引量:7
  • 3王小东,李刚,欧宗瑛.一维下料优化的一种新算法[J].大连理工大学学报,2004,44(3):407-411. 被引量:21
  • 4汪小银,部庭荣.数学软件与数学实验[M].北京:科学出版社,2008.
  • 5汪小银,周保平.数学建模与数学实验[M].北京:科学出版社,2010.

二级参考文献26

  • 1刘勇彪.等截面长条类材料下料方案的最优化设计[J].机械设计与制造,1994(5):12-13. 被引量:5
  • 2Liang Ko-Hsin, Yao Xin, Newton C, et al. A new evolutionary approach to cutting stock problems with and without contiguity [ J ]. Computer & Operations Research, 2002,(29): 1 641-1 659.
  • 3Scheithauer G,Terno J. The modified integer round-up property of the one-dimensional cutting stock problem [ J ]. European Journal of Operational Research,1995, (84) :562 -571.
  • 4Nitsche Ch, Scheithauer G, Terno J. New case of the cutting stock problem having MIRUP [ J]. Mathematical Methods of Operations Research, 1998, (48): 105 - 115.
  • 5Nitsche Ch, Scheithauer G, Terno J. Tighter relaxations for the cutting stock problem [ J ]. European Journal of Operational Research, 1999, (112): 654 -663.
  • 6Rietz J, Scheithauer G, Terno J. Families of non-IRUP instances of the one-dimensional cutting stock problem [ J ].Discrete Applied Mathematics ,2002, (121) :229 -245.
  • 7Hinxman A I. The trim -loss and assortment problems: A survey [ J ]. European Journal of Operational Research,1980, (5): 8-18.
  • 8Cheng C H, Feiring B R, Cheng T C E. The cutting stock problem-A survey [ J ]. International Journal of Production economics, 1994, (36): 291-305.
  • 9Dyckoff H. A typology of cutting and packing problems [ J]. European Journal of Operational Research, 1990, (44): 145 - 159.
  • 10Gradisar M, Resinovic G, Kljajic M. Evaluation of algorithms for one-dimensional cutting [ J ]. Computers & Operations Research, 2002, (29): 1 207 - 1 220.

共引文献27

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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