铁塔制造企业角钢下料的算法研究及软件实现
|
摘要
本篇论文基于作者在研究生期间参与的ERP项目的设计开发实施工作的成果为基础，针对目前机械制造行业缺乏一个完全独立自动的角钢下料软件的情况，提出一套完整的角钢(线材)下料计算方案。
目前，在国内，乃至国际上，都很少有能够自动进行有效的能应用于实际企业制造的下料系统，在作者所接触的铁塔制造行业，能进行完全高速自动化的计算机下料的企业少之又少。同时，角钢下料这一模块却又是整个企业主要的利润来源，如何有效地提高原材料的利用率，降低原材料损耗，减少大量的人力操作，同时又能保证整个下料系统高速稳定的运作，成为很多铁塔制造行业目前所急需解决的问题。
本文通过实际的应用研究，提出一种满足实际操作的角钢下料系统，它不仅能够提高原材料的利用率(通常能保证原材料平均利用率大于97％)，而且能够保证其计算的速度。经过大量的实际运作，有效地降低了原材料的损耗，减少了繁琐的手工重复劳动，从而使企业能够实现利润的增长。
本文先从理论上分析了这种行之有效的下料算法，然后从实际计算机软件的角度确定软件实现的可能性，并在文章的后半段分析了该下料模块商品化所应该具备的条件，同时在文章末分析了整个下料问题领域的最新研究进展。
This article is base on the ERP project who author participate in when graduate student, Facing the fact of the lack of a efficiently cutting stock module in the enterprise, A brand-new method was came into being to solve the One-Dimensional Cutting Stock Problem.
The article puts forward a kind of satisfied unloading system of angle steel that operated actually through the real application study , It can not merely improve the utilization ratio of the raw materials( can usually guarantee that the average utilization ratio of raw materials is greater than 97% ), And can guarantee the speed of its calculation .
Having analysed the effectual unloading algorithm theoretically first in this text, Then from actual computer determine possibility who software realize by the angles of software, And latter half pieces of analysis this module in article commercialize terms that should possess , Analysed at the end in the article at the same time that the newest research of the question field of whole unloading develops .
目前，在国内，乃至国际上，都很少有能够自动进行有效的能应用于实际企业制造的下料系统，在作者所接触的铁塔制造行业，能进行完全高速自动化的计算机下料的企业少之又少。同时，角钢下料这一模块却又是整个企业主要的利润来源，如何有效地提高原材料的利用率，降低原材料损耗，减少大量的人力操作，同时又能保证整个下料系统高速稳定的运作，成为很多铁塔制造行业目前所急需解决的问题。
本文通过实际的应用研究，提出一种满足实际操作的角钢下料系统，它不仅能够提高原材料的利用率(通常能保证原材料平均利用率大于97％)，而且能够保证其计算的速度。经过大量的实际运作，有效地降低了原材料的损耗，减少了繁琐的手工重复劳动，从而使企业能够实现利润的增长。
本文先从理论上分析了这种行之有效的下料算法，然后从实际计算机软件的角度确定软件实现的可能性，并在文章的后半段分析了该下料模块商品化所应该具备的条件，同时在文章末分析了整个下料问题领域的最新研究进展。
This article is base on the ERP project who author participate in when graduate student, Facing the fact of the lack of a efficiently cutting stock module in the enterprise, A brand-new method was came into being to solve the One-Dimensional Cutting Stock Problem.
The article puts forward a kind of satisfied unloading system of angle steel that operated actually through the real application study , It can not merely improve the utilization ratio of the raw materials( can usually guarantee that the average utilization ratio of raw materials is greater than 97% ), And can guarantee the speed of its calculation .
Having analysed the effectual unloading algorithm theoretically first in this text, Then from actual computer determine possibility who software realize by the angles of software, And latter half pieces of analysis this module in article commercialize terms that should possess , Analysed at the end in the article at the same time that the newest research of the question field of whole unloading develops .
引文
[1] Jia Zhixin, Yin Guofu, Luo Yang. Two-Dimensional Irregular Parts Packing with Genetic Algorithm[J]. Journal of Computer-Aided Design & Computer Graphics, 2002, 14(5): 467-470(in Chinese)(贾志欣，殷国富，罗阳．二维不规则零件排样问题的遗传算法求解[J]．2002，5：467～470)
[2] Garey M R, Johnson D S. Computers and Intractability: A Guide t0 the Theory of NP-Completeness. Freeman,1979
[3] Fisher M L The Lagrangian relaxation method for solving integer programming problems, Management Science,1981,27(1): 1～18
[4] 薛嘉庆。线性规划。北京：高等教育出版社，1989
[5] 李修睦，李为政。数学规划引论。武汉：华中师大出版社，1989
[6] 俞玉森等。数学规划的原理和方法。武汉：华中理工大学出版社，1993
[7] 钱颂迪等。运筹学。北京：清华大学出版社，1990
[8] 范明玉，张莹，最优化技术，清华大学出版社，1982，142-148
[9] 王正志，薄涛，进化计算，国防科技大学出版社，2000，136-138
[10] 周明，孙树栋，遗传算法原理及应用，国防工业出版社，1999，40-50
[11] Naessler R.W and sweeney P.E.,Cutting-Stock Problem and Solution Procedures, European Journal of operation Research, 1991, 54141—150
[12] 刘勇，康立山，陈统屏。非数值并行算法—遗传算法，科学出版社，1997 1—3
[13] Goldberg, D.E.,Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wisley, Reading, MA, 1989
[14] Chen Chuen-Lung S.,Hart Stephen M.,Tham Wai Mui, A Simulated Annealing Heuristic for the One Dimensional Cutting Stock Problem, European Journal of Operation Research, 1996.93:522-535
[15] Davis L.,Handbook of Genetic Algorithms, Van Nostrand Reinbold. New York.
[16] Winter G.,Periaux J.,Galan M.,Cuesta P.,Genetic Algorithms in Engneering and Computer Science, John Wiley, 1995
[17] Johnson D.S. Fast Algorithms for bin packing, Journal of Computer and System Science 1974.8:272-314
[18] Dyckhoff. H. A new linear programming approach to the cutting stock problem. Operations Research. 1981.29(6):1092-1104
[19] Gilmore P.C. and Gomory R.E., Multistage cutting stock problems of two and more dimensions. Operations Research 1965,13:94-120.
[20] Julien A., Chauvet F.,Chengbin chu, Jean-Marie Proth. The cutting stock problem with mixed objectives:Tow heuristics based on dynamic programming. European Journal of Operation Research 1994, 114:395-402
[21] Zilla Sinuany-Stern and Ittai Weiner. The one Dimensional cutting stock
problem using two objectives. Journal of the Operational Research Society. 1994.45(2):231-236
[22] Robert W. Haessler. Controlling cutting pattern changes in one-dimensional Trim Problems. Operations Research, 1975,23(3):483-493
[23] 李军，用于最优化的计算智能。北京：清华大学出版社，1999
[24] 闵仲求。合理下料的实用数学模型及计算机软件的研究。系统工程理论与实践，1982年第四期：36-41
[25] 杨世胜，合理下料模型及其软件实现，电气自动化，1986年第一期：41-47
[26] 李树团，CPPM管材套料程序，微计算机应用。1985(4)：45-48
[27] 袁仲良，最优化下料方法与程序，天津：天津大学出版社，1980
[28] 马仲藩，现行整数规划的数学基础，北京：科学出版社，1998
[29] 徐天秀，一类特殊整数线性规划的迭代解法—最优下料问题的求解。系统工程，1989．9
[30] 黄振侃，唐薇，整数线性规划算法的计算机实现。北京工业大学学报，1994 20(4)
[31] 赵立平，张治，赵阳，DELPHI数据库应用程序开发技术，清华大学出版社，1998
[2] Garey M R, Johnson D S. Computers and Intractability: A Guide t0 the Theory of NP-Completeness. Freeman,1979
[3] Fisher M L The Lagrangian relaxation method for solving integer programming problems, Management Science,1981,27(1): 1～18
[4] 薛嘉庆。线性规划。北京：高等教育出版社，1989
[5] 李修睦，李为政。数学规划引论。武汉：华中师大出版社，1989
[6] 俞玉森等。数学规划的原理和方法。武汉：华中理工大学出版社，1993
[7] 钱颂迪等。运筹学。北京：清华大学出版社，1990
[8] 范明玉，张莹，最优化技术，清华大学出版社，1982，142-148
[9] 王正志，薄涛，进化计算，国防科技大学出版社，2000，136-138
[10] 周明，孙树栋，遗传算法原理及应用，国防工业出版社，1999，40-50
[11] Naessler R.W and sweeney P.E.,Cutting-Stock Problem and Solution Procedures, European Journal of operation Research, 1991, 54141—150
[12] 刘勇，康立山，陈统屏。非数值并行算法—遗传算法，科学出版社，1997 1—3
[13] Goldberg, D.E.,Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wisley, Reading, MA, 1989
[14] Chen Chuen-Lung S.,Hart Stephen M.,Tham Wai Mui, A Simulated Annealing Heuristic for the One Dimensional Cutting Stock Problem, European Journal of Operation Research, 1996.93:522-535
[15] Davis L.,Handbook of Genetic Algorithms, Van Nostrand Reinbold. New York.
[16] Winter G.,Periaux J.,Galan M.,Cuesta P.,Genetic Algorithms in Engneering and Computer Science, John Wiley, 1995
[17] Johnson D.S. Fast Algorithms for bin packing, Journal of Computer and System Science 1974.8:272-314
[18] Dyckhoff. H. A new linear programming approach to the cutting stock problem. Operations Research. 1981.29(6):1092-1104
[19] Gilmore P.C. and Gomory R.E., Multistage cutting stock problems of two and more dimensions. Operations Research 1965,13:94-120.
[20] Julien A., Chauvet F.,Chengbin chu, Jean-Marie Proth. The cutting stock problem with mixed objectives:Tow heuristics based on dynamic programming. European Journal of Operation Research 1994, 114:395-402
[21] Zilla Sinuany-Stern and Ittai Weiner. The one Dimensional cutting stock
problem using two objectives. Journal of the Operational Research Society. 1994.45(2):231-236
[22] Robert W. Haessler. Controlling cutting pattern changes in one-dimensional Trim Problems. Operations Research, 1975,23(3):483-493
[23] 李军，用于最优化的计算智能。北京：清华大学出版社，1999
[24] 闵仲求。合理下料的实用数学模型及计算机软件的研究。系统工程理论与实践，1982年第四期：36-41
[25] 杨世胜，合理下料模型及其软件实现，电气自动化，1986年第一期：41-47
[26] 李树团，CPPM管材套料程序，微计算机应用。1985(4)：45-48
[27] 袁仲良，最优化下料方法与程序，天津：天津大学出版社，1980
[28] 马仲藩，现行整数规划的数学基础，北京：科学出版社，1998
[29] 徐天秀，一类特殊整数线性规划的迭代解法—最优下料问题的求解。系统工程，1989．9
[30] 黄振侃，唐薇，整数线性规划算法的计算机实现。北京工业大学学报，1994 20(4)
[31] 赵立平，张治，赵阳，DELPHI数据库应用程序开发技术，清华大学出版社，1998