2006
DOI: 10.1016/j.rcim.2005.04.001
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of process route by Genetic Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0
1

Year Published

2010
2010
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 56 publications
(25 citation statements)
references
References 2 publications
0
22
0
1
Order By: Relevance
“…The goal of operation sequencing is to find the optimal operation sequence. It is known through practice that in operation sequencing, the theoretic constraints cannot be satisfied fully, so if the final operation sequence can satisfy obligatory constraints and other additive constraints, the operation sequence is reasonable (Bo et al 2006) According to this condition, the constraint aggregation of the operation sequence may be divided into two categories: a compulsive constraint aggregation and an additive constraint aggregation.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The goal of operation sequencing is to find the optimal operation sequence. It is known through practice that in operation sequencing, the theoretic constraints cannot be satisfied fully, so if the final operation sequence can satisfy obligatory constraints and other additive constraints, the operation sequence is reasonable (Bo et al 2006) According to this condition, the constraint aggregation of the operation sequence may be divided into two categories: a compulsive constraint aggregation and an additive constraint aggregation.…”
Section: Methodsmentioning
confidence: 99%
“…The fitness value of individual is only a relative concept (only used for value comparisons and the value itself is not concerned), so the problem of sampling error does not exist. Compared with other selection operators, the “tournament selection” is more suitable for the problem of operations sequencing (Bo et al 2006). In order to guarantee the astringency of GA, the optimal (best) individual in one generation must be kept for the next generation.…”
Section: Methodsmentioning
confidence: 99%
“…(2) Crossover There are three crossover operators for path representation: Partially Mapped Crossover (PMX), Order Crossover (OX) and Cycle Crossover (CX) [23]. The aim of PMX crossover is keeping the important similarities of parent and child generation.…”
Section: Input Layermentioning
confidence: 99%
“…GA-based approaches were developed by Bo et al, 1 Hua et al, 2 Li et al, 3 Dereli and Filiz, 4 Reddy et al, 5 Qiao et al, 6 and Salehi and Tavakkoli-Moghaddam. 7 A simulated annealing (SA)-based approach has been used by Ma et al 8 Particle Swarm Optimization (PSO) methods have also been explored by Guo et al 9 Lv and Zhu 10 and Krishna and Rao 11 have used Ant Colony Optimization approaches.…”
Section: Review Of Previous Researchmentioning
confidence: 99%