A GRASP with path-relinking for private virtual circuit routing

DOI10.1002/NET.10065MaRDI QIDQ4804169zbMATH OpenOpenAlexFDO

Authors Mauricio G. C. Resende, Celso C. Ribeiro

Publication date 10 April 2003

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10065

zbMATH Keywords

bandwidth packingframe relayGRASPmetaheuristicsmulticommodity network flowsoffline reroutingpath-relinkingprivate virtual circuitrouting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Recommendations

• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
• Virtual path design in service-specific ATM networks
• A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks
• scientific article; zbMATH DE number 2090689
• scientific article; zbMATH DE number 1532269

Cited in

(28)

• GRASP for set packing problems.
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• A multi-objective model for environmental investment decision making
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
• TTT plots: a perl program to create time-to-target plots
• Path relinking for the vehicle routing problem
• Scatter search --- wellsprings and challenges
• A GRASP and path relinking heuristic for rural road network development
• An evolutionary algorithm based hyper-heuristic framework for the set packing problem
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• A branch-and-cut algorithm for partition coloring
• Community detection by modularity maximization using GRASP with path relinking
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements
• Extending time-to-target plots to multiple instances
• Probabilistic stopping rules for GRASP heuristics and extensions
• Lot-sizing for production planning in a recovery system with returns
• A hybrid metaheuristic for routing on multicast networks
• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
• Optimizing server placement in distributed systems in the presence of competition
• Multicommodity information flow through quantum annealer
• Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
• Restart strategies for GRASP with path-relinking heuristics
• A conic quadratic formulation for a class of convex congestion functions in network flow problems
• GRASP with path-relinking for the generalized quadratic assignment problem
• Routing and wavelength assignment by partition colouring
• Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

This page was built for publication: A GRASP with path-relinking for private virtual circuit routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4804169)