Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks

Authors:
Belén Melián
Affiliations:
Dpto. E.I.O. y Computación, Universidad de La Laguna, Spain
Venue:
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Year:
2006

Citing 5
Cited 0

Bandwidth packing: a tabu search approach

Management Science
Integrated broadband networks: TCP/IP, ATM, SDH/SONET, and WDM/Optics

Integrated broadband networks: TCP/IP, ATM, SDH/SONET, and WDM/Optics
Tabu Search

Tabu Search
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.