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 条

[21] Productivity model for the cell formation problem: a simulated annealing algorithm
Abdelmola, AI
Taboun, SM
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) : 327 - 330
[22] Genetic algorithm and large neighbourhood search to solve the cell formation problem
Elbenani, Bouazza
Ferland, Jacques A.
Bellemare, Jonathan
[J]. EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (03) : 2408 - 2414
[23] Heuristic and simulated annealing algorithms for solving extended cell assignment problem in wireless ATM networks
Din, DR
Tseng, SS
[J]. INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2002, 15 (01) : 47 - 65
[24] An evolutionary programming based simulated annealing method for solving the unit commitment problem
Christober Asir Rajan, C.
Mohan, M. R.
[J]. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2007, 29 (07) : 540 - 550
[25] Neural-based simulated annealing method for solving the unit commitment problem
Rajan, CCA
Mohan, MR
Manivannan, K
[J]. ENGINEERING INTELLIGENT SYSTEMS FOR ELECTRICAL ENGINEERING AND COMMUNICATIONS, 2002, 10 (04): : 241 - 253
[26] Solving the Fixed Graph Coloring Problem by Simulated Annealing and Greedy Search
Zhao, Kai
Geng, Xiutang
Xu, Jin
[J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (04) : 637 - 646
[27] A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
Gunawan, Aldy
Ng, Kien Ming
Poh, Kim Leng
[J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 3074 - 3088
[28] Solving a real-world nurse rostering problem by Simulated Annealing
Ceschia, Sara
Di Gaspero, Luca
Mazzaracchio, Vincenzo
Policante, Giuseppe
Schaerf, Andrea
[J]. OPERATIONS RESEARCH FOR HEALTH CARE, 2023, 36
[29] Solving the Course Scheduling Problem Using Simulated Annealing
Aycan, E.
Ayav, T.
[J]. 2009 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE, VOLS 1-3, 2009, : 462 - 466
[30] Solving a home energy management problem by Simulated Annealing
Edoardo Bastianetto
Sara Ceschia
Andrea Schaerf
[J]. Optimization Letters, 2021, 15 : 1553 - 1564

← 1 2 3 4 5 →