.png){kind=icon}
返回
A parallel hybrid optimization algorithm for some network design problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-017-2907-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Network design problems have been widely studied in the last decades due to the importance of ICT in our daily life and are still the subject of extensive researches. Network design covers a large family of problems, and several algorithms, both exact and heuristic methods, have been proposed to address each of them. In this paper, we consider two variants of the so-called survivable network design problem and propose a generic parallel hybrid algorithm to solve them. The algorithm is based on the hybridization of a Lagrangian relaxation algorithm, a greedy algorithm and a genetic algorithm. We present, for each variant, a computational study showing the efficiency of our approach in producing both lower and upper bounds for the optimal solution.
Keyword:
Genetic algorithm
Hybridization
kHNDP
kESNDP
Lagrangian relaxation
Metaheuristic
Parallel computing
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Predicting cancer incidence in regions without population-based cancer registries using mortality
OAAI
OAAI分享收藏21<sup>st</sup> Century challenges of clean energy and global warming-can energy storage systems meet these issues?.png)
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and Applications
2010 3rd International Conference on Thermal Issues in Emerging Technologies Theory and ApplicationsIF0
PREAI
分享收藏
分享收藏
查看更多内容