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 条
  • [1] Rule and branch-and-bound algorithm based sequencing of machining features for process planning of complex parts
    Wang, Wei
    Li, Yingguang
    Huang, Lingling
    JOURNAL OF INTELLIGENT MANUFACTURING, 2018, 29 (06) : 1329 - 1336
  • [2] Product cooperative disassembly sequence planning based on branch-and-bound algorithm
    Xiu Fen Zhang
    Shu You Zhang
    The International Journal of Advanced Manufacturing Technology, 2010, 51 : 1139 - 1147
  • [3] Product cooperative disassembly sequence planning based on branch-and-bound algorithm
    Zhang, Xiu Fen
    Zhang, Shu You
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 51 (9-12): : 1139 - 1147
  • [4] Transmission system expansion planning by a branch-and-bound algorithm
    Rider, M. J.
    Garcia, A. V.
    Romero, R.
    IET GENERATION TRANSMISSION & DISTRIBUTION, 2008, 2 (01) : 90 - 99
  • [5] Specialised branch-and-bound algorithm for transmission network expansion planning
    Haffner, S
    Monticelli, A
    Garcia, A
    Romero, R
    IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION, 2001, 148 (05) : 482 - 488
  • [6] On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions
    M. Locatelli
    U. Raber
    Journal of Optimization Theory and Applications, 2000, 107 : 69 - 79
  • [7] On convergence of the simplicial branch-and-bound algorithm based on ω-subdivisions
    Locatelli, M
    Raber, U
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 107 (01) : 69 - 79
  • [8] A branch-and-bound algorithm for the multi-stage transmission expansion planning
    Asada, EN
    Carreño, E
    Romero, R
    Garcia, AV
    2005 IEEE POWER ENGINEERING SOCIETY GENERAL MEETING, VOLS, 1-3, 2005, : 171 - 176
  • [9] BRANCH-AND-BOUND ALGORITHM FOR 2-STAGE PRODUCTION-SEQUENCING PROBLEMS
    USKUP, E
    SMITH, SB
    OPERATIONS RESEARCH, 1975, 23 (01) : 118 - 136
  • [10] Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer
    Schwan, K.
    Gawkowski, J.
    Blake, B.
    Conference on Hypercube Concurrent Computers and Applications, 1988,