SIMULATED ANNEALING METHOD WITH DIFFERENT NEIGHBORHOODS FOR SOLVING THE CELL FORMATION PROBLEM

被引:0
|
作者
Luong Thuan Thanh [1 ]
Ferland, Jacques A. [1 ,2 ]
Nguyen Dinh Thuc [3 ]
Van Hien Nguyen [1 ,4 ]
机构
[1] Inst Computat Sci & Technol, ICST HCMC, Ho Chi Minh City, Vietnam
[2] Univ Montreal, Dept Comp Sci & Operat Res, Montreal, PQ, Canada
[3] Vietnam Natl Univ, Fac Informat Technol, Univ Sci, Ho Chi Minh City, Vietnam
[4] Univ Namur FUNDP, Dept Math, Namur, Belgium
来源
ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS | 2011年
关键词
Cell formation problem; Metaheuristic; Simulated annealing; Diversification; Intensification; Neighborhood; SIMILARITY COEFFICIENT METHOD; GROUPING GENETIC ALGORITHM; GROUP TECHNOLOGY; PART-FAMILIES; OPTIMIZATION; ASSIGNMENT; MATRICES; MODEL;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we solve the cell formation problem with different variants of the simulated annealing method obtained by using different neighborhoods of the current solution. The solution generated at each iteration is obtained by using a diversification of the current solution combined with an intensification to improve this solution. Different diversification and intensification strategies are combined to generate different neighborhoods. The most efficient variant allows improving the best-known solution of one of the 35 benchmark problems commonly used by authors to compare their methods, and reaching the best-known solution of 30 others.
引用
收藏
页码:525 / 533
页数:9
相关论文
共 50 条
  • [1] Solving the Cubic Cell Formation Problem Using Simulated Annealing
    Bouaziz, Hamida
    Lemouari, Ali
    INTERNATIONAL JOURNAL OF INFORMATION RETRIEVAL RESEARCH, 2022, 12 (01)
  • [2] A simulated annealing method for solving a new mathematical model of a multi-criteria cell formation problem with capital constraints
    Tavakkoli-Moghaddam, R.
    Rahimi-Vahed, A. R.
    Ghodratnama, A.
    Siadat, A.
    ADVANCES IN ENGINEERING SOFTWARE, 2009, 40 (04) : 268 - 273
  • [3] Refined simulated annealing method for solving the unit commitment problem
    Rajan, CCA
    ENGINEERING INTELLIGENT SYSTEMS FOR ELECTRICAL ENGINEERING AND COMMUNICATIONS, 2004, 12 (04): : 243 - 251
  • [4] Solving Cutting Scheduling Problem by Simulated Annealing Search Method
    Tung, Kuan-Ting
    Chen, Chih-Yu
    Hung, Yi-Feng
    2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2016, : 907 - 911
  • [5] Refined simulated annealing method for solving unit commitment problem
    Rajan, CCA
    Mohan, MR
    Manivannan, K
    PROCEEDING OF THE 2002 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-3, 2002, : 333 - 338
  • [6] Refined simulated annealing method for solving the unit commitment problem
    Rajan, C. Cristober Asir
    Engineering Intelligent Systems, 2004, 12 (04): : 243 - 251
  • [7] The study on the roles of neighborhoods in Simulated Annealing method
    Chen, XD
    Qian, JG
    Qiao, JQ
    Ni, GZ
    Yang, SY
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON ELECTROMAGNETIC FIELD PROBLEMS AND APPLICATIONS, 2000, : 182 - 184
  • [8] A SIMULATED ANNEALING SOLUTION TO THE CELL-FORMATION PROBLEM
    CHEN, CL
    COTRUVO, NA
    BAEK, W
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1995, 33 (09) : 2601 - 2614
  • [9] Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods
    Ceschia, Sara
    Guido, Rosita
    Schaerf, Andrea
    ANNALS OF OPERATIONS RESEARCH, 2020, 288 (01) : 95 - 113
  • [10] Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods
    Sara Ceschia
    Rosita Guido
    Andrea Schaerf
    Annals of Operations Research, 2020, 288 : 95 - 113