2006
DOI: 10.1007/s00170-005-0235-2
|View full text |Cite
|
Sign up to set email alerts
|

Assembly planning using a novel immune approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 42 publications
(32 citation statements)
references
References 17 publications
0
32
0
Order By: Relevance
“…The optimum set of parameters found to be able to provide the optimal/near optimal assembly sequence in reasonable time is population size of 10, fraction of worst eggs that are thrown out 10%, probability used in generating new eggs to replace those that are thrown out 90%. After the CS algorithm is run using the above set of parameters, the optimal assembly sequence obtained is [1,2,3,4,5,6,7,8,9,10,11,12,13,14] with fitness value of 1.5269, requiring 7 tool changes, 4 reorientation changes, stability index of 9, having the base component at the first location of the assembly sequence, and most importantly the sequence was found to have no feasibility (precedence) violations. In order to evaluate the effectiveness of the proposed CS algorithm, it is compared with Improved Harmony Search (IHS) algorithm [12].…”
Section: Results Of Proposed Cs Algorithm For Assembly Sequence Optimmentioning
confidence: 99%
See 3 more Smart Citations
“…The optimum set of parameters found to be able to provide the optimal/near optimal assembly sequence in reasonable time is population size of 10, fraction of worst eggs that are thrown out 10%, probability used in generating new eggs to replace those that are thrown out 90%. After the CS algorithm is run using the above set of parameters, the optimal assembly sequence obtained is [1,2,3,4,5,6,7,8,9,10,11,12,13,14] with fitness value of 1.5269, requiring 7 tool changes, 4 reorientation changes, stability index of 9, having the base component at the first location of the assembly sequence, and most importantly the sequence was found to have no feasibility (precedence) violations. In order to evaluate the effectiveness of the proposed CS algorithm, it is compared with Improved Harmony Search (IHS) algorithm [12].…”
Section: Results Of Proposed Cs Algorithm For Assembly Sequence Optimmentioning
confidence: 99%
“…In order to evaluate the effectiveness of the proposed CS algorithm, it is compared with Improved Harmony Search (IHS) algorithm [12]. The best sequence generated by the IHS algorithm is found to be [ 6,11,12,13,14,7,8,9,10] with fitness value of 1.5077, requiring 7 tool changes, 5 reorientation changes, stability index of 9, having base component at the first location of the assembly sequence, no feasibility violations but is clearly sub-optimal when compared to the sequence generated by CS algorithm. Figure 8 shows comparison between the convergence graphs of the CS and IHS algorithms from which it can be concluded that the proposed CS algorithm clearly outperforms IHS in terms of convergence speed as it is able to reach the global best fitness value in lesser number of iterations.…”
Section: Results Of Proposed Cs Algorithm For Assembly Sequence Optimmentioning
confidence: 99%
See 2 more Smart Citations
“…Closely related to GA, another population-based optimization technique, called Immune Optimization Approach (IOA) uses the bionic principles of Artificial Immune Systems (AIS) Cao and Xiao (2007). The assembly sequencing problems are represented as antigens, and antibodies represent the assembly sequences of the product, encoded in their genes as component numbers.…”
Section: Other Biological Analoguesmentioning
confidence: 99%