首页 | 官方网站   微博 | 高级检索  
     

计算机辅助剪床优化排料算法的研究
引用本文:刘文明,李定坤,陈建华,傅清祥.计算机辅助剪床优化排料算法的研究[J].福州大学学报(自然科学版),1998(1):15-19.
作者姓名:刘文明  李定坤  陈建华  傅清祥
作者单位:福州大学计算机科学与技术系
摘    要:研究计算机辅助剪床优化排料算法,根据问题的特点建立了下料方式和下料方案的数学模型,然后依其特殊性提出类似于单纯形法在可行域边界点搜索的穷举法来求解下料方式模型.同时对传统的方法进行改进,提出一个对下料方案数学模型实用、高效的改进型分支定界解法.在系统实现过程中充分考虑了用户需求,充分利用用户原有资源,提供方便友好的用户界面.

关 键 词:剪床  优化排料  整数规划

Research on Computer Aided Optimal Layout Algorithm for Guillotine Shear
Liu Wenming,Li Dingkun,Chen Jianhua,Fu Qingxiang.Research on Computer Aided Optimal Layout Algorithm for Guillotine Shear[J].Journal of Fuzhou University(Natural Science Edition),1998(1):15-19.
Authors:Liu Wenming  Li Dingkun  Chen Jianhua  Fu Qingxiang
Affiliation:Liu Wenming Li Dingkun Chen Jianhua Fu Qingxiang (Department of Computer Science and Technology, Fuzhou University, Fuzhou, 350002)
Abstract:In this paper, we describe a study and development of a computer aided system for optimal layout, in which acceptable cutting patterns are limited to those of guillotine type. Based on the requirements of manufacture, two mathematical models for cutting patterns and layout methods are established. Then, we propose a method of exhaustion to solve model one by searching for the solution at boundary points of feasible region like simplex method, and we improve the traditional branch bound method for model two and obtain a satisfactory result. Besides, the needs of the users are best met, original resources anr fully used and a friendly interface for the users is provided in the system.
Keywords:guillotine shear  optimal layout  integer programming
本文献已被 CNKI 等数据库收录!
点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《福州大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号