Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks
From MaRDI portal
Publication:932187
DOI10.1016/j.ejor.2006.12.060zbMath1160.90330OpenAlexW2063446209MaRDI QIDQ932187
Holger Höller, Stefan Voß, Belén Melián-Batista
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.060
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs ⋮ Variable neighbourhood search: methods and applications ⋮ Unnamed Item ⋮ Algorithms for the non-bifurcated network design problem ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Variable neighbourhood search: Methods and applications ⋮ Solution techniques for the inter-modal pickup and delivery problem in two regions
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Looking ahead with the pilot method
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- Variable neighborhood search
- Rollout algorithms for combinatorial optimization
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- Bandwidth Packing: A Tabu Search Approach
- Mersenne twister
- Variable Neighborhood Search
- Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network
