Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The NP-complete Steiner tree problem is a fundamental ...
complementary method. In this study, we proposed a novel standalone path relinking algorithm for the delay-constrained least-cost multicast routing problem.
A Path Relinking Approach for Delay-Constrained Least-Cost ...
dl.acm.org › doi › abs › ICTAI.2007.28
Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The NP-complete Steiner tree problem is a fundamental ...
Bibliographic details on A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem.
Abstract. This paper presents the first fitness landscape analysis on the delay-constrained least-cost multicast routing problem (DCLC-MRP), a well-known ...
This paper presents a real-time multicast routing algorithm which minimizes overall network cost without letting the delay from a source to any destination ...
Abstract. This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-. Constrained Least-Cost (DCLC) multicast ...
delay-constrained, least-cost multicast routing problem. It outperforms other algorithms and heuristics over a range of problem instances. 1 Introduction.
This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-Constrained Least-Cost (DCLC) multicast routing ...
In this paper we investigate a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constrained least-cost (DCLC) ...