An interactive approach to solve the operation sequencing problem using simulated annealing

被引:10
|
作者
Pandey, Vijay [1 ]
Tiwari, M. K.
Kumar, S.
机构
[1] Birla Inst Technol, Dept Prod Engn, Ranchi 835215, Bihar, India
[2] Natl Inst Foundry & Forge Technol, Dept Mfg Engn, Ranchi 834003, Bihar, India
关键词
neighbourhood generation; operation sequencing; setup selection; simulated annealing;
D O I
10.1007/s00170-005-0007-z
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The problem of operation sequencing is affected by geometrical parameters such as tool compatibility, feature symmetry, feature accessibility, feature orientation and non-geometrical parameters such as dimensional tolerance, geometric tolerance, location tolerance and surface finish. Operation sequences are determined after meeting the objective functions such as minimum setup changeover and tool changeover, maximum tool motion continuity and maximum loose precedence among features. Because of the conflicting nature of the objectives and constraints, it is a tedious task to formulate a single objective function that can meet the requirements of the problem. Thus in this paper, an attempt has been made to address this issue to an extent by developing operation sequencing rating index (OSRI) which is the weighted sum of four indices: setup changeover index, tool changeover index, motion continuity index and loose precedence index. Determination of setup changeover index involves datum selection and sequencing in addition to grouping features into setup. Owing to the combinatorial nature of the problem, the simulated annealing (SA) based algorithm has been employed to determine the optimal/near-optimal operation sequence by maximising OSRI. In the proposed methodology, a perturbation scheme named as modified shifting scheme (MSS) has been devised to generate a feasible neighbourhood sequence that minimizes the search space and helps the algorithm to escape from local optima. A new approach for temperature variation in the SA algorithm is also incorporated in which the temperature is assumed to be parabolic. The advantage and effectiveness of the proposed methodology in terms of its algorithmic implementation have been verified on four test parts.
引用
收藏
页码:1212 / 1231
页数:20
相关论文
共 50 条
  • [1] An interactive approach to solve the operation sequencing problem using simulated annealing
    Vijay Pandey
    M. K. Tiwari
    S. Kumar
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 29 : 1212 - 1231
  • [2] An interactive approach to solve the operation sequencing problem using simulated annealing
    Pandey, Vijay
    Tiwari, M.K.
    Kumar, S.
    [J]. International Journal of Advanced Manufacturing Technology, 2006, 29 (11-12): : 1212 - 1231
  • [3] A Parallel Approach of Simulated Annealing Using GPGPU to Solve the Quadratic Assignment Problem
    Takemoto, Lucas Arakaki
    Dantas, Bianca de Almeida
    Mongelli, Henrique
    [J]. 2018 SYMPOSIUM ON HIGH PERFORMANCE COMPUTING SYSTEMS (WSCAD 2018), 2018, : 23 - 29
  • [4] Using simulated annealing to solve the classroom assignment problem
    MartinezAlfaro, H
    Minero, J
    Alanis, GE
    Leal, NA
    Avila, IG
    [J]. PROCEEDINGS ISAI/IFIS 1996 - MEXICO - USA COLLABORATION IN INTELLIGENT SYSTEMS TECHNOLOGIES, 1996, : 370 - 377
  • [5] A Simulated Annealing based approach to solve the generator maintenance scheduling problem
    Saraiva, Joao Tome
    Pereira, Marcelo Leandro
    Mendes, Virgilio Torrado
    Sousa, Jose Carlos
    [J]. ELECTRIC POWER SYSTEMS RESEARCH, 2011, 81 (07) : 1283 - 1291
  • [6] A simulated annealing approach to solve a multi traveling salesman problem in a FMCG company
    Rao, T. Srinivas
    [J]. MATERIALS TODAY-PROCEEDINGS, 2021, 46 : 4971 - 4974
  • [7] Optimization of operation sequencing in CAPP using simulated annealing technique (SAT)
    G. Nallakumarasamy
    P. S. S. Srinivasan
    K. Venkatesh Raja
    R. Malayalamurthi
    [J]. The International Journal of Advanced Manufacturing Technology, 2011, 54 : 721 - 728
  • [8] Optimization of operation sequencing in CAPP using simulated annealing technique (SAT)
    Nallakumarasamy, G.
    Srinivasan, P. S. S.
    Raja, K. Venkatesh
    Malayalamurthi, R.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 54 (5-8): : 721 - 728
  • [9] SIMULATED ANNEALING APPROACH TO SOLVE A CELLULAR MANUFACTURING SYSTEM USING MDMTSP
    Mahdavi, Iraj
    Paydar, Mohammad Mahdi
    Sharafuddin, Iman
    Solimanpur, Maghsud
    [J]. PROCEEDINGS OF THE 38TH INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2008, : 181 - 190
  • [10] Using a simulated annealing algorithm to solve the transit route network design problem
    Fan, W
    Machemehl, RB
    [J]. JOURNAL OF TRANSPORTATION ENGINEERING-ASCE, 2006, 132 (02): : 122 - 132