2022
DOI: 10.1016/j.ejco.2021.100024
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 34 publications
0
1
0
Order By: Relevance
“…This involved optimizing the neighbourhood search process and using simulated annealing and greedy algorithms to facilitate the frequency regularization process and generate new solutions with fewer frequencies and reduced influence of interferences. The superiority of a simulated annealing approach to solving the minimal interference problem has been demonstrated in several instances [116] using two benchmarks [44,117]. This study provided the first known instance/solution database for this FAP.…”
Section: Trajectory Methodsmentioning
confidence: 99%
“…This involved optimizing the neighbourhood search process and using simulated annealing and greedy algorithms to facilitate the frequency regularization process and generate new solutions with fewer frequencies and reduced influence of interferences. The superiority of a simulated annealing approach to solving the minimal interference problem has been demonstrated in several instances [116] using two benchmarks [44,117]. This study provided the first known instance/solution database for this FAP.…”
Section: Trajectory Methodsmentioning
confidence: 99%
“…"intlinprog" is a function provided by the MATLAB optimization toolbox TM for Integer linear programming problems. This section is comprehensive with reference to MATLAB's Optimization Toolbox User's Guide [15]. The mathematical model of IP in MATLAB is:…”
Section: Parametersmentioning
confidence: 99%
“…The meta-heuristic algorithms, such as genetic algorithm (GA), particle swarm optimization (PSO), memetic algorithm (MA), and simulated annealing (SA), have been widely employed to effectively solve mixed integer linear programming (MILP) models in the context of production scheduling. These methods have been applied successfully in various industrial fields and demonstrate their advantages in tackling complex and large-scale problems [12][13][14][15]. However, the computational time is a big concern.…”
Section: Introductionmentioning
confidence: 99%
“…2 on related work). In addition, we have experienced promising results with multi-neighborhood simulated annealing also on problems that show some similarities, like for example Examination Timetabling (Bellio et al, 2021) or Minimum Interference Frequency Assignment (Ceschia et al, 2021).…”
Section: Introductionmentioning
confidence: 99%