2011
DOI: 10.1007/s11431-011-4594-7
|View full text |Cite
|
Sign up to set email alerts
|

A multi-dimensional tabu search algorithm for the optimization of process planning

Abstract: Computer-aided process planning (CAPP) is an essential component of computer integrated manufacturing (CIM) system. A good process plan can be obtained by optimizing two elements, namely, operation sequence and the machining parameters of machine, tool and tool access direction (TAD) for each operation. This paper proposes a novel optimization strategy for process planning that considers different dimensions of the problem in parallel. A multi-dimensional tabu search (MDTS) algorithm based on this strategy is … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(9 citation statements)
references
References 33 publications
(62 reference statements)
0
9
0
Order By: Relevance
“…In addition, according to the slow speed and low-frequency signals in the paper, the initial search range of the system parameters a and b can be set into [0. 1,10]. Then, the current method is applied to the fault diagnosis of the gearbox in combined machining center.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, according to the slow speed and low-frequency signals in the paper, the initial search range of the system parameters a and b can be set into [0. 1,10]. Then, the current method is applied to the fault diagnosis of the gearbox in combined machining center.…”
Section: Resultsmentioning
confidence: 99%
“…Under operation, the components' faults degrade the machining accuracy [6][7][8][9][10][11]. It is difficult to detect fault feature, especially weak fault feature, which is usually submerged in the noise because the structures of combined machining centers are complex.…”
Section: Introductionmentioning
confidence: 99%
“…As one of main features in the TS heuristic, the tabu list recording the recent search history is used to avoid searching recently explored solutions. The TS heuristic has successfully solved various combinatorial optimization problems, such as job shop scheduling [42], computer-aided process planning [43], and multiple yard scheduling [44]. It has solved some of VRP variants [45][46][47].…”
Section: Solution Approachmentioning
confidence: 99%
“…In the past three decades, many optimization approaches have been developed and widely applied for solving process planning problem, such as knowledge-based reasoning approach [ 5 , 6 ], graph manipulation [ 7 , 8 ], the genetic algorithm (GA) [ 9 11 ], tabu search approach (TS) [ 4 , 12 ], simulated annealing (SA) algorithm [ 3 , 13 ], particle swarm optimization (PSO) [ 14 , 15 ], artificial neural networks [ 16 ], ant colony optimization (ACO) [ 17 , 18 ], and artificial immune system (AIS) [ 19 ].…”
Section: Previous Related Workmentioning
confidence: 99%