Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem

DOI10.1016/J.EJCO.2021.100024MaRDI QIDQ6114925zbMATH OpenOpenAlexFDO

Authors Sara Ceschia, Luca Di Gaspero, Roberto Maria Rosati, Andrea Schaerf

Publication date 12 July 2023

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejco.2021.100024

zbMATH Keywords

frequency assignmentneighborhood searchparameter tuningsimulated annealing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A Decomposed Approach for the Minimum Interference Frequency Assignment
• Tabu search for frequency assignment in mobile radio networks
• Models and solution techniques for frequency assignment problems
• Optimized planning of frequency hopping in cellular networks
• scientific article; zbMATH DE number 997663

Cites work

• A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
• A survey of local search methods for graph coloring
• Algorithms for Radio Link Frequency Assignment: The Calma Project
• An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem
• Frequency assignment in cellular phone networks
• Heuristic manipulation, tabu search and frequency assignment
• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• scientific article; zbMATH DE number 997663 (Why is no real title available?)
• scientific article; zbMATH DE number 3196612 (Why is no real title available?)
• Local search algorithms for the radio link frequency assignment problem
• Lower bounds for fixed spectrum frequency assignment
• Models and solution techniques for frequency assignment problems
• Optimization by simulated annealing
• Optimized planning of frequency hopping in cellular networks
• Revisiting simulated annealing: a component-based analysis
• Solving partial constraint satisfaction problems with tree decomposition
• Tabu search with simple ejection chains for coloring graphs
• The frequency assignment problem: A solution via nonlinear programming
• The stable set problem and the thinness of a graph
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling

Cited in

(1)

• An optimisation model for minimising changes in frequency allocations

This page was built for publication: Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem

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