2015
DOI: 10.1016/j.asoc.2015.08.044
|View full text |Cite
|
Sign up to set email alerts
|

Two-level iterated local search for WDM network design problem with traffic grooming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 35 publications
0
2
0
Order By: Relevance
“…Another idea for dealing with complex structural problems is to use a hierarchical metatrial approach, where several trials are combined in a nested structure. Wu et al [28] successfully implemented a two-level iterative local search for a network design problem with traffic sparing. According to their analysis, hierarchical metaheuristics must be carefully designed to balance the complexity of the algorithm and its performance.…”
Section: Introductionmentioning
confidence: 99%
“…Another idea for dealing with complex structural problems is to use a hierarchical metatrial approach, where several trials are combined in a nested structure. Wu et al [28] successfully implemented a two-level iterative local search for a network design problem with traffic sparing. According to their analysis, hierarchical metaheuristics must be carefully designed to balance the complexity of the algorithm and its performance.…”
Section: Introductionmentioning
confidence: 99%
“…This metaheuristic acts as a black box, only requiring three functions to run: a constructive, a perturbation and a local search procedure. The performance of ILS in solving combinatorial network optimisation problems is also present in the literature [Wu15]. x ← constructivePhase() x ← localSearchPhase(x)…”
Section: Iterated Local Searchmentioning
confidence: 99%