Name
Title | ||
|---|---|---|
A Real Adjacency Matrix-Coded Differential Evolution Algorithm for Traveling Salesman Problems. |
Abstract | ||
|---|---|---|
Permutation-based combinatorial optimization problems have very wide application. Aim of the study is to design a real coding mechanism for evolutionary computing to solve permutation-based COPs. A real adjacency matrix-coded differential evolutionary algorithm (RAMDE) is proposed to solve traveling salesman problem (TSP): a classic COP. Considering TSP structure, a swarm of real adjacency matrices is adopted to represent individuals within population and arithmetical operators of DE execute in form of real matrices. Experimental results show that the proposed real adjacency matrix-coding mechanism is promising to extend DE for COPs. |
Year | Venue | Field |
|---|---|---|
2016 | BIC-TA | Adjacency list,Bottleneck traveling salesman problem,Adjacency matrix,Population,Mathematical optimization,Evolutionary algorithm,Computer science,Evolutionary computation,Algorithm,Travelling salesman problem,2-opt |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hang Wei | 1 | 0 | 1.35 |
| Zhifeng Hao | 2 | 653 | 78.36 |
| han huang | 3 | 17 | 4.73 |
| Gang Li | 4 | 0 | 0.34 |
| Qinqun Chen | 5 | 0 | 2.03 |