2011 Eighth International Conference on Information Technology: New Generations 2011
DOI: 10.1109/itng.2011.141
|View full text |Cite
|
Sign up to set email alerts
|

Priority Encoding Scheme for Solving Permutation and Constraint Problems with Genetic Algorithms and Simulated Annealing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Generalpurpose encoding schemes do not usually consider problem-specific requirements, such as dependent problem constraints, so infeasible (not valid) individuals are often generated (Nowling & Mauch, 2011). A common constraint in optimization problems appears when the sum of the elements that are part of a solution must be a constant, as when working with probabilities (Su, et al, 2008) (Russell & Norvig, 2009).…”
Section: Introductionmentioning
confidence: 99%
“…Generalpurpose encoding schemes do not usually consider problem-specific requirements, such as dependent problem constraints, so infeasible (not valid) individuals are often generated (Nowling & Mauch, 2011). A common constraint in optimization problems appears when the sum of the elements that are part of a solution must be a constant, as when working with probabilities (Su, et al, 2008) (Russell & Norvig, 2009).…”
Section: Introductionmentioning
confidence: 99%