Rule and branch-and-bound algorithm based sequencing of machining features for process planning of complex parts

被引:0
|
作者
Wei Wang
Yingguang Li
Lingling Huang
机构
[1] Nanjing University of Aeronautics and Astronautics,College of Mechanical and Electrical Engineering
来源
Journal of Intelligent Manufacturing | 2018年 / 29卷
关键词
Process planning; Machining features; Feature sequencing; Operation sequencing; Rule-based reasoning ; Branch-and-bound Algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
The machining sequence of machining features is vital to achieve efficient and high quality manufacturing of complex NC machining parts. In most feature-based process planning system, the machining features are sequenced as the lowest level unit. However, a single machining feature of complex parts such as aircraft structural parts is usually machined by multiple machining operations. The one-to-many mappings between the machining features and the machining operations cause the increase of the non-cutting tool path. In order to solve this problem, some types of machining features of complex parts are decomposed into several sub-machining features that are associated with a single machining operation individually according to the rules which are abstracted from the machining process of complex parts. Benefitting from the decomposition, the sub-machining features from different machining feature can be assembled into a sub-machining feature in order to avoid the cutting tool marks. The different types of sub-machining features are sequenced in the light of some rules which are also extracted from the machining process of complex parts. And the branch-and-bound algorithm are employed to sequence the same type sub-machining features to minimum the non-cutting tool path. A pilot feature-based process planning system has been developed based on this research, and has been used in some aircraft manufacturers in China.
引用
收藏
页码:1329 / 1336
页数:7
相关论文
共 50 条
  • [31] A Lagrangian Based Branch-and-Bound Algorithm for Production-transportation Problems
    TAKAHITO KUNO
    TAKAHIRO UTSUNOMIYA
    Journal of Global Optimization, 2000, 18 : 59 - 73
  • [32] An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
    Li, Chu-Min
    Quan, Zhe
    PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 128 - 133
  • [33] Task-Binding Based Branch-and-Bound Algorithm for NoC Mapping
    Zhou, Liyang
    Jing, Ming'e
    Zhong, Liulin
    Yu, Zhiyi
    Zeng, Xiaoyang
    2012 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS 2012), 2012, : 648 - 651
  • [34] Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
    Lu, Cheng
    Deng, Zhibin
    Zhang, Wei-Qiang
    Fang, Shu-Cherng
    JOURNAL OF GLOBAL OPTIMIZATION, 2018, 70 (01) : 171 - 187
  • [35] Reactive power dispatch and planning using a non-linear branch-and-bound algorithm
    Estevam, C. R. N.
    Rider, M. J.
    Amorim, E.
    Mantovani, J. R. S.
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2010, 4 (08) : 963 - 973
  • [36] Platform Resource Scheduling Method Based on Branch-and-Bound and Genetic Algorithm
    Zhang Y.
    Ma J.
    Zhang H.
    Yue B.
    Annals of Data Science, 2023, 10 (5) : 1421 - 1445
  • [37] Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
    Cheng Lu
    Zhibin Deng
    Wei-Qiang Zhang
    Shu-Cherng Fang
    Journal of Global Optimization, 2018, 70 : 171 - 187
  • [38] An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
    Shen, Peiping
    Wu, Dianxiao
    Wang, Yafei
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2023, 426
  • [39] A maximum edge-weight clique extraction algorithm based on branch-and-bound
    Shimizu, Satoshi
    Yamaguchi, Kazuaki
    Masuda, Sumio
    DISCRETE OPTIMIZATION, 2020, 37
  • [40] A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
    Cacchiani, Valentina
    D'Ambrosio, Claudia
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (03) : 920 - 933