Using Memory to Improve the VNS Metaheuristic for the Design of SDH/WDM Networks
Variable neigborhood search is among the well studied local search based metaheuristics. It has provided good results for many combinatorial optimization problems throughout the last decade. Based on previous successful applications of this metaheuristic on various network design problems in telecommunications, we further enhance this approach by incorporating adaptive memory mechanisms from the scatter search and tabu search metaheuristics. The heuristics are compared among each other as well as against objective function values obtained from a mathematical programming formulation based on a commercial solver. The problem instances cover a large variety of networks and demand patterns. The analysis carried out in this paper corroborates that there are significant differences between the variable neighborhood search and the hybrid approach.
KeywordsWavelength Division Multiplex Variable Neighborhood Variable Neighborhood Search Network Design Problem Scatter Search
Unable to display preview. Download preview PDF.
- 1.Conover, W.J.: Practical Nonparametric Statistics. John Wiley and Sons, Chichester (1999)Google Scholar
- 4.Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics (2003)Google Scholar
- 5.Höller, H., Melián, B., Voß, S.: Applying the pilot method to improve vns and grasp metaheuristics for the design of sdh/wdm networks. (submitted for publication) (April 20006)Google Scholar
- 6.Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic Publishers, Boston (2003)Google Scholar
- 7.Lee, B., Kim, W.: Integrated Broadband Networks. Artech House, Boston (2002)Google Scholar