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 条
  • [31] USING SIMULATED ANNEALING TO SOLVE ROUTING AND LOCATION-PROBLEMS
    GOLDEN, BL
    SKISCIM, CC
    [J]. NAVAL RESEARCH LOGISTICS, 1986, 33 (02) : 261 - 279
  • [32] A New Approach Based On the Hybridization of Simulated Annealing Algorithm and Tabu Search to Solve the Static Ambulance Routing Problem
    Zidi, Issam
    Al-Omani, Mohammad
    Aldhafeeri, Karim
    [J]. KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KES 2019), 2019, 159 : 1216 - 1228
  • [33] A Simulated Annealing Algorithm to Solve the Multi-objective Bike Routing Problem
    Nunes, P.
    Moura, A.
    Santos, J. P.
    Completo, A.
    [J]. 2021 INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND INTELLIGENT CONTROLS (ISCSIC 2021), 2021, : 39 - 45
  • [34] An Extended Simulated Annealing Based on the Memory Structure to Solve Redundancy Allocation Problem
    Zaretalab, Arash
    Hajipour, Vahid
    [J]. JOURNAL OF ADVANCED MANUFACTURING SYSTEMS, 2019, 18 (04) : 527 - 548
  • [35] A New Hybrid Genetic and Simulated Annealing Algorithm to Solve the Traveling Salesman Problem
    Elhaddad, Younis
    Sallabi, Omar
    [J]. WORLD CONGRESS ON ENGINEERING, WCE 2010, VOL I, 2010, : 11 - 14
  • [36] Clustering Search and Simulated Annealing to solve the driver scheduling problem for timber transport
    Costa, Marcos Favero
    Fiedler, Nilton Cesar
    Mauri, Geraldo Regis
    [J]. SCIENTIA FORESTALIS, 2013, 41 (99): : 299 - 305
  • [37] A novel approach for solving travelling thief problem using enhanced simulated annealing
    Ali, Hamid
    Rafique, Muhammad Zaid
    Sarfraz, Muhammad Shahzad
    Malik, Muhammad Sheraz Arshad
    Alqahtani, Mohammed A.
    Alqurni, Jehad Saad
    [J]. PEERJ COMPUTER SCIENCE, 2021, 7 : 1 - 18
  • [38] A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain
    Mansouri, S. Afshin
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2006, 50 (1-2) : 105 - 119
  • [39] An Interactive Simulated Annealing Multi-agents Platform to Solve Hierarchical Scheduling Problems with Goals
    Dhouib, Souhail
    Kouraichi, Sana
    Loukil, Taicir
    Chabchoub, Habib
    [J]. NICSO 2008: NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION, 2009, 236 : 177 - +
  • [40] A SIMULATED ANNEALING APPROACH TO THE SEARCH PROBLEM OF PROTEIN CRYSTALLOGRAPHY
    SUBBIAH, S
    HARRISON, SC
    [J]. ACTA CRYSTALLOGRAPHICA SECTION A, 1989, 45 : 337 - 342