Name
Title | ||
|---|---|---|
Two-level evolutionary approach to the survivable mesh-based transport network topological design |
Abstract | ||
|---|---|---|
The complete topology design problem of survivable mesh-based transport networks is to address simultaneously design of network topology, working path routing, and spare capacity allocation based on span-restoration. Each constituent problem in the complete design problem could be formulated as an Integer Programming (IP) and is proved to be $\mathcal{NP}$ -hard. Due to a large amount of decision variables and constraints involved in the IP formulation, to solve the problem directly by exact algorithms (e.g. branch-and-bound) would be impractical if not impossible. In this paper, we present a two-level evolutionary approach to address the complete topology design problem. In the low-level, two parameterized greedy heuristics are developed to jointly construct feasible solutions (i.e., closed graph topologies satisfying all the mesh-based network survivable constraints) of the complete problem. Unlike existing "zoom-in"-based heuristics in which subsets of the constraints are considered, the proposed heuristics take all constraints into account. An estimation of distribution algorithm works on the top of the heuristics to tune the control parameters. As a result, optimal solution to the considered problem is more likely to be constructed from the heuristics with the optimal control parameters. The proposed algorithm is evaluated experimentally in comparison with the latest heuristics based on the IP software CPLEX, and the "zoom-in"-based approach on 28 test networks problems. The experimental results demonstrate that the proposed algorithm is more effective in finding high-quality topologies than the IP-based heuristic algorithm in 21 out of 28 test instances with much less computational costs, and performs significantly better than the "zoom-in"-based approach in 19 instances with the same computational costs. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s10732-009-9115-5 | J. Heuristics |
Keywords | Field | DocType |
Survivable mesh-based network,Network topology design,Heuristics,Evolutionary algorithm,Estimation of distribution algorithm | Mathematical optimization,Parameterized complexity,Optimal control,Evolutionary algorithm,Estimation of distribution algorithm,Heuristic (computer science),Network topology,Theoretical computer science,Heuristics,Integer programming,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 5 | 1381-1231 |
Citations | PageRank | References |
0 | 0.34 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Sun | 1 | 0 | 0.34 |
| Qingfu Zhang | 2 | 7634 | 255.05 |
| J. Li | 3 | 0 | 0.34 |