Improved heuristics for the regenerator location problem

DOI10.1111/itor.12085zbMath1308.90032OpenAlexW2114320142MaRDI QIDQ5175825

Rafael Martí, Ricardo M. A. Silva, Abraham Duarte, Mauricio G. C. Resende

Publication date: 25 February 2015

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12085

zbMATH Keywords

metaheuristicsgenetic algorithmsGRASPlocationnetwork designregenerator

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Multiobjective GRASP with path relinking, A biased random key genetic algorithm for the field Technician scheduling problem, Regenerator Location Problem in Flexible Optical Networks, Regenerator location problem: polyhedral study and effective branch-and-cut algorithms, A biased random-key genetic algorithm for single-round divisible load scheduling

Uses Software

• GRASP

Cites Work

• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search procedures
• The regenerator location problem
• An annotated bibliography of GRASP-Part II: Applications
• An annotated bibliography of GRASP – Part I: Algorithms
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Probabilistic stopping rules for GRASP heuristics and extensions
• Randomized heuristics for the family traveling salesperson problem
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling