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 条
  • [21] Simulated Annealing to solve single stage capacitated warehouse location problem
    Santosa, Budi
    Kresna, I. Gusti Ngurah Agung
    [J]. INDUSTRIAL ENGINEERING AND SERVICE SCIENCE 2015, IESS 2015, 2015, 4 : 62 - 70
  • [22] Investigation of simulated annealing components to solve the university course timetabling problem
    AlHadid, Issam
    Kaabneh, Khalid
    Tarawneh, Hassan
    Alhroob, Aysh
    [J]. ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2020, (44): : 291 - 301
  • [23] Investigation of simulated annealing components to solve the university course timetabling problem
    AlHadid, Issam
    Kaabneh, Khalid
    Tarawneh, Hassan
    Alhroob, Aysh
    [J]. Italian Journal of Pure and Applied Mathematics, 2020, 44 : 282 - 290
  • [24] Integrating Relative Coordinates with Simulated Annealing to Solve a Traveling Salesman Problem
    Liu, Xiaojun
    Zhang, Bin
    Du, Fangying
    [J]. 2014 SEVENTH INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION (CSO), 2014, : 177 - 180
  • [25] Modified Simulated Annealing Hybrid Algorithm to Solve the Traveling Salesman Problem
    Chandomi-Castellanos, Eduardo
    Escobar-Gomez, Elias N.
    Aguilar Marroquin-Cano, Sergio F.
    Hernandez-de-Leon, Hector R.
    Velazquez-Trujillo, Sabino
    Sarmiento-Torres, Jorge A.
    de-Coss-Perez, Carlos, V
    [J]. 2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), 2022, : 1536 - 1541
  • [26] ON THE MAPPING PROBLEM USING SIMULATED ANNEALING
    LEE, C
    BIC, L
    [J]. EIGHTH ANNUAL INTERNATIONAL PHOENIX CONFERENCE ON COMPUTERS AND COMMUNICATIONS: 1989 CONFERENCE PROCEEDINGS, 1989, : 40 - 44
  • [27] A simulated annealing approach for the circular cutting problem
    Hifi, M
    Paschos, VT
    Zissimopoulos, V
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 159 (02) : 430 - 448
  • [28] A simulated annealing approach to the traveling tournament problem
    A. Anagnostopoulos
    L. Michel
    P. Van Hentenryck
    Y. Vergados
    [J]. Journal of Scheduling, 2006, 9 : 177 - 193
  • [29] A simulated annealing approach to the traveling tournament problem
    Anagnostopoulos, A
    Michel, L
    Van Hentenryck, P
    Vergados, Y
    [J]. JOURNAL OF SCHEDULING, 2006, 9 (02) : 177 - 193
  • [30] Solving the WDM network operation problem using dynamic synchronous parallel simulated annealing
    Khan, A
    Thompson, DR
    [J]. PROCEEDINGS OF THE IEEE SOUTHEASTCON 2004: EXCELLENCE IN ENGINEERING, SCIENCE, AND TECHNOLOGY, 2005, : 296 - 301