Name
Abstract | ||
|---|---|---|
In this paper, we present a Population Disturbing Operator based on Ranking to improve the optimization efficiency of genetic algorithm. The operator is a dynamic-adaptive operator, which can not only prevent the population from the coming early convergence but also conduct the existed early convergence. When applying the improved GA to resolve the capacity and flow assignment (CFA) problem, we use a better integer-encoding rather than normal binary-coding. The integer-encoding can reduce many constraints of the CFA optimization model. The test results indicate that the improved GA is very efficient for solving the CFA problem. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16388-3_11 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Capacity and Flow Assignments,Network Design Problems,Ranking Based Selection,Integer-encoding | Convergence (routing),Population,Mathematical optimization,Ranking,Flow (psychology),Algorithm,Operator (computer programming),Genetic algorithm,Mathematics | Conference |
Volume | Issue | ISSN |
107 | null | 1865-0929 |
Citations | PageRank | References |
3 | 0.43 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lin GM | 1 | 1048 | 90.67 |
| Chengbo Huang | 2 | 3 | 0.77 |
| Shaobin Zhan | 3 | 3 | 0.43 |
| Xin Lu | 4 | 6 | 1.56 |
| Yunting Lu | 5 | 8 | 3.70 |