Results 261 to 270 of about 473,326 (299)

Simulated annealing algorithm in solving frequency assignment problem

2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE), 2010
The development of new digital terrestrial TV broadcasting services led to scarcity of useable frequencies, it is necessary to assign each transmitter a suitable frequency to guarantee well function of transmitters with minimum frequency span. Frequency assignment problem is a combinatorial optimization problem, in this paper introduced a simple ...
null Lu Liwei, null Fan Rongshuang
openaire   +1 more source

Simple value ordering heuristic in frequency assignment problem

2009 International Conference on Computers & Industrial Engineering, 2009
In this paper, we introduce one simple heuristic for value ordering in solving frequency assignment problem. Our approach is based on a special container to organize the values selection by jumping between two sides of domain. In order to reduce the time and space complexities of algorithm, we change the current value selection with last unchecked ...
Jun Hu, Alexandre Caminada, Hakim Mabed
openaire   +1 more source

A Metaheuristic Approach for the Frequency Assignment Problem

2010 International Conference on Computational Intelligence and Software Engineering, 2010
The Frequency Assignment Problem (FAP) is considered in this paper. As the co-site constraint (CSC) may cause more interference in the real-world situation, we have paid more attention on CSC. The algorithm proposed here is a metaheuristic approach, which uses heuristic information combined with a modified PSO (Particle Swarm Optimization) algorithm to
Yuanyuan Zhang, Ming Chen
openaire   +1 more source

Solving the frequency assignment problem with differential evolution

2007 15th International Conference on Software, Telecommunications and Computer Networks, 2007
In this paper it is presented and researched the possibility of using the differential evolution (DE) algorithm to solve the frequency assignment problem (FAP). This problem involves a free assignment of a number of available frequencies to a set of requesters, subject to a set of specified constraints given by an interference matrix.
Marisa da Silva Maximiano, Miguel A. Vega-Rodriguez, Juan A. Gomez-Pulido, Juan M. Sanchez-Perez   +3 more
openaire   +1 more source

Frequency assignment problem using discrete particle swarm model

2009 International Conference on Multimedia Computing and Systems, 2009
The problem of the fixed-spectrum frequency assignment, where the objective is to minimize the cost due to the interference arising in a solution, is studied and solved in this paper using a discrete particle swarm optimization which is refined by a deterministic local search heuristic.
L. Benameur, J. Alami, A. El Imrani
openaire   +1 more source

Frequency-Based Maritime Multi-Container Assignment Problem Formulation

CICTP 2016, 2016
This paper presents a new maritime container assignment model to seek the most proper method to assign two different types of containers with different priorities to minimize its objective function. This model enforces the flow conversation of each node, examines whether each link is attractive, and takes the throughput constraints and shipping sizes ...
Weiwei Liu, Lin Cheng, Jiangshan Ma, Zhao Fang, Renjie Chen   +4 more
openaire   +1 more source

Tabu Thresholding for the Frequency Assignment Problem

1996
The frequency assignment problem is to allocate frequencies to communication links such that the total interference is minimised. In this paper we investigate a tabu thresholding procedure to solve the frequency assignment problem. Several variants of the method are implemented using large computer-generated but realistic data sets.
Diane Castelino, Nelson Stephens
openaire   +1 more source

Further Results on T-Coloring and Frequency Assignment Problems

SIAM Journal on Discrete Mathematics, 1994
The \(T\)-coloring problem is investigated in which integers are assigned to the vertices of a graph \(G\), under the constraint that the absolute value of the difference between integers assigned to adjacent vertices does not belong to a forbidden set called the \(T\)-set. Values of interest are the minimum cardinality, \(\chi_ T(G)\), and the minimum
openaire   +1 more source

Solving Frequency Assignment Problems

Fourteenth International Wrocław Symposium and Exhibition, Electromagnetic Compatibility 1998, 1998
S. M. Allen, S. Hurley, D. H. Smith, W. J. Watkins   +3 more
openaire   +1 more source

Stochastic Frequency Assignment Problem

2012
Benajam, Wadie, Gaivoronski, Alexei, Lisser, Abdel   +2 more
openaire   +2 more sources