Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networksHolger Höller, Belén Melián and Stefan VoíŸ European Journal of Operational Research, 2008, vol. 191, issue 3, pages 691-704 Abstract: Variable neighborhood search (VNS) and Greedy randomized adaptive search procedure (GRASP) are among the well studied local search based metaheuristics providing good results for many combinatorial optimization problems throughout the last decade. While they are usually explored in different environments one may encounter quite obvious commonalities. Based on previous successful applications of these two types of metaheuristics on various network design problems in telecommunications, we further enhance these approaches by incorporating ideas from the pilot method. The different 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. Downloads: (external link) Related works: Access Statistics for this article European Journal of Operational Research is edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
Econpapers is hosted by the
Swedish Business School at Örebro University.