期刊文献+

集成环境下客车用料优化排样与定额管理 被引量:2

Optimal layout and quota management of rail vehicle material under integration environment
原文传递
导出
摘要 轨道客车制造企业需要大量使用板材加工,通过使用优化排样系统可以大大减少材料的使用量,减少企业制造成本。而优化排样系统与PDM、ERP等系统的集成可以保证数据的准确性和一致性。通过优化排样系统的集成环境导入相关数据,修改工艺参数;并使用遗传算法实现对矩形件和不规则件优化排样;对优化排样的结果进行定额计算,最终得到单件定额、下料明细及材料汇总定额等数据,确保了企业对客车板材的最合理使用。 Using optimal layout system, the usage of material and manufacturing cost are greatly reduced. The accuracy and consistency of data are ensured by optimal layout system integration with PDM, ERP system. Related data was imported from the integration of envi- ronmental by layout optimization system, and process parameters were modified. Using genetic algorithm, the optimal layout for rectangu- lar and irregular parts was realized. The layout optimization results were calculated to get data as single quota, blanking subsidiary, mate- rial summary quota and so on. So, the rational using of vehicle plates for the enterprise was ensured.
出处 《锻压技术》 CAS CSCD 北大核心 2014年第1期142-145,共4页 Forging & Stamping Technology
基金 国家自然科学基金资助项目(51207016 51277019) 辽宁省教育厅项目(L2011076)
关键词 集成系统 优化排样 定额管理 PDM ERP integration system optimal layout quota management PDM ERP
  • 相关文献

参考文献6

  • 1Michel G, Gilbert I,, Ferderie S. lteuristies and lower bounds for the bin packing pnblem with conflicts [ J]. Compute & Opera- firms Reseacrh, 2004, 41 (31): 347-358.
  • 2Porsenjit B, Pat M. Antoine V packing two disks into a Polygonal environment [ J ]. Journal of Diserete Algorithms, 2004, (2) : 373 - 80.
  • 3Christofides N. An algorithm fir two-dimensional cutting prob- lems [ J]. Computers 8,' Operations Research, 1977, 25 ( 1 ) : 30 - 40.
  • 4Kennedy J, Eberhart R C, Shi Y. Swarm Intelligence [ M ]. San Franeisoeo: Mogan Kaufmann Publishers, 2001.
  • 5Wang P T. Two algorithm fir constrained two-dimensional cutting stock pnblems [ J]. Computet'.; & Operations Research, 1983, 31 (3) : 573 -586.
  • 6Kocarev L, Jak lmosk 1 G. Lslic map as a bhM'k em',pdon algo- rithm [J]. Physicsl,etters,2001, 289 (4 -5): 199 -206.

同被引文献12

  • 1Cui Y, Wang Q. Exact and heuristic algorithms for the circle cut- ting problem in the manufacturing industry of electric motors [ J ]. Journal of Combinatorial Optimization, 2007, 14 (1) : 35 -44.
  • 2Bennell J A, Oliveira J F. The geometry of nesting problems: A tutorial [ J ]. European Journal of Operational Research, 2008, 184 (2) : 397 -415.
  • 3Cui Y. Generating optimal T-shape cutting patterns for circular blanks [J]. Computers & Operations Research, 2005, 32 (1) :143 - 152.
  • 4Kellerer H, Pferschy U, Pisinger D. Knapsack Problems [ M ]. Berlin : Springer, 2004.
  • 5Gilmore P C, Gomory R E. A linear programming approach to the cutting-stock problem [ J]. Operations Research, 1961, 9 (6) : 849 - 859.
  • 6Gilmore P C, Gomory R E. A linear programming approach to the cutting stock problem-Part II [J]. Operations Research, 1963, 11 (6) : 863 -888.
  • 7Furini F, Malaguti E, Duran R M, et al. A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size [ J ]. European Journal of Opera- tional Research, 2012, 218 (1) : 251 -260.
  • 8杨少杰,崔耀东.同尺寸矩形毛坯排样算法[J].桂林理工大学学报,2012,35(4):628-630. 被引量:7
  • 9潘卫平,陈秋莲,崔耀东,李华.多板材单一矩形件下料问题的一种求解算法[J].锻压技术,2014,39(11):6-10. 被引量:6
  • 10易向阳,仝青山,潘卫平.矩形件二维下料问题的一种求解方法[J].锻压技术,2015,40(6):150-154. 被引量:21

引证文献2

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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