Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks

No abstract is available for this paper.

• Publication year

  2008

• Venue

  European Journal of Operational Research

• Publication date

  2008-12-16

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1016/j.ejor.2006.12.060
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Greedy Randomized Adaptive Search Procedures

  2009cited by this paper
• Variable Neighborhood Search

  2009cited by this paper
• Variable neighborhood search

  2008cited by this paper
• Designing WDM networks by a variable neighborhood search

  2006cited by this paper
• A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks

  2006cited by this paper
• Looking Ahead with the Pilot Method

  2005cited by this paper
• Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network

  2005cited by this paper
• Guest editorial

  2003cited by this paper
• Variable Neighbourhood Search

  2003cited by this paper
• Greedy Randomized Adaptive Search Procedures.

  2003cited by this paper
• The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs

  1999cited by this paper
• Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

  1998cited by this paper
• Rollout Algorithms for Combinatorial Optimization

  1997cited by this paper
• Variable neighborhood search

  1997cited by this paper
• Operations Research Proceedings 1993

  1994cited by this paper
• Steiner Tree Heuristics — A Survey

  1994cited by this paper
• Bandwidth packing: a tabu search approach

  1993cited by this paper
• Integrated broadband networks

  1991cited by this paper
• Heuristics : intelligent search strategies for computer problem solving

  1984cited by this paper
• A note on two problems in connexion with graphs

  1959cited by this paper

• Solution techniques for the inter-modal pickup and delivery problem in two regions

  2020cites this paper
• Skewed Variable Neighborhood Search Method for the Weighted Generalized Regenerator Location Problem

  2018cites this paper
• An Overview of the Last Advances and Applications of Greedy Randomized Adaptive Search Procedure

  2018cites this paper
• A variable neighborhood search simheuristic for project portfolio selection under uncertainty

  2018cites this paper
• hybrid GRASP-VNS for Ship Routing and Scheduling Problem with Discretized Time Windows. Engineering Applications of Artificial Intelligence

  2017cites this paper
• Metaheuristics for the Districting and Routing Problem for Security Control

  2016cites this paper
• Improving local-search metaheuristics through look-ahead policies

  2015cites this paper
• Variable Neighborhood Search for a Dynamic Rich Vehicle Routing Problem with time windows

  2015cites this paper
• GVNS for a real-world Rich Vehicle Routing Problem with Time Windows

  2015cites this paper
• A Hybrid GRASP-VNS for Ship Routing and 1 Scheduling Problem with Discretized Time Windows

  2015cites this paper
• Energy efficiency of elastic frequency grids in multilayer IP/MPLS-over-flexgrid networks

  2015cites this paper
• Heurísticas para o problema de caminho mais curto robusto

  2013cites this paper
• Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks

  2013cites this paper
• A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem

  2013cites this paper
• Cross-layer modeling and optimization of next-generation internet networks

  2012cites this paper
• Wavelength assignment for reducing in-band crosstalk attack propagation in optical networks: ILP formulations and heuristic algorithms

  2012cites this paper
• Developing a Ring-Based Optical Network Structure with Glass-Through Nodes

  2012cites this paper
• Models and heuristics for the k ‐degree constrained minimum spanning tree problem with node‐degree costs

  2012cites this paper
• CAPEX study for a multilayer IP/MPLS-over-flexgrid optical network

  2012cites this paper
• Heuristic design and provisioning of resilient multi-layer networks

  2012cites this paper
• Prize collecting Steiner trees with node degree dependent costs

  2011cites this paper
• Neigborhood Selection in Variable Neighborhood Search

  2011cites this paper
• Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations

  2010cites this paper
• Variable neighbourhood search: methods and applications

  2010cites this paper
• Algorithms for the non-bifurcated network design problem

  2009cites this paper
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem

  2009cites this paper
• Variable Neighborhood Search : Methods and Applications

  2008cites this paper
• Using Memory to Improve the VNS Metaheuristic for the Design of SDH/WDM Networks

  2006cites this paper