Frequency assignment for cellular mobile systems using constraint satisfaction techniques

Makoto Yokoo, Katsutoshi Hirayama

Research output: Contribution to journalConference article

8 Citations (Scopus)

Abstract

This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint satisfaction techniques. The characteristics of this algorithm are as follows: 1) instead of representing each call in a cell (a unit area in providing communication services) as a variable, we represent a cell (which has multiple calls) as a variable that has a very large domain, and determine a variable value step by step, 2) a powerful cell-ordering heuristic is introduced, 3) a branch-and-bound search that incorporates forward-checking is performed, and 4) the limited discrepancy search is introduced to improve the chance of finding a solution in a limited amount of search. Experimental evaluations using standard benchmark problems show that this algorithm can find optimal or semi-optimal solutions for these problems, and most of the obtained solutions are better than or equivalent to those of existing methods using simulated annealing, tabu search, or neural networks. These results show that state-of-the-art constraint satisfaction/optimization techniques are capable of solving realistic application problems when equipped with an appropriate problem representation and heuristics.

Original languageEnglish
Pages (from-to)888-894
Number of pages7
JournalIEEE Vehicular Technology Conference
Volume2
Publication statusPublished - Jan 1 2000
Externally publishedYes
EventVTC2000: 51st Vehicular Technology Conference 'Shaping History Through Mobile Technologies' - Tokyo, Jpn
Duration: May 15 2000May 18 2000

Fingerprint

heuristics
Tabu search
simulated annealing
Simulated annealing
communication
Neural networks
Communication
evaluation
method
state of the art
services

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

Frequency assignment for cellular mobile systems using constraint satisfaction techniques. / Yokoo, Makoto; Hirayama, Katsutoshi.

In: IEEE Vehicular Technology Conference, Vol. 2, 01.01.2000, p. 888-894.

Research output: Contribution to journalConference article

@article{03e93d25e0214b05a3a255569370469a,
title = "Frequency assignment for cellular mobile systems using constraint satisfaction techniques",
abstract = "This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint satisfaction techniques. The characteristics of this algorithm are as follows: 1) instead of representing each call in a cell (a unit area in providing communication services) as a variable, we represent a cell (which has multiple calls) as a variable that has a very large domain, and determine a variable value step by step, 2) a powerful cell-ordering heuristic is introduced, 3) a branch-and-bound search that incorporates forward-checking is performed, and 4) the limited discrepancy search is introduced to improve the chance of finding a solution in a limited amount of search. Experimental evaluations using standard benchmark problems show that this algorithm can find optimal or semi-optimal solutions for these problems, and most of the obtained solutions are better than or equivalent to those of existing methods using simulated annealing, tabu search, or neural networks. These results show that state-of-the-art constraint satisfaction/optimization techniques are capable of solving realistic application problems when equipped with an appropriate problem representation and heuristics.",
author = "Makoto Yokoo and Katsutoshi Hirayama",
year = "2000",
month = "1",
day = "1",
language = "English",
volume = "2",
pages = "888--894",
journal = "IEEE Vehicular Technology Conference",
issn = "0740-0551",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Frequency assignment for cellular mobile systems using constraint satisfaction techniques

AU - Yokoo, Makoto

AU - Hirayama, Katsutoshi

PY - 2000/1/1

Y1 - 2000/1/1

N2 - This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint satisfaction techniques. The characteristics of this algorithm are as follows: 1) instead of representing each call in a cell (a unit area in providing communication services) as a variable, we represent a cell (which has multiple calls) as a variable that has a very large domain, and determine a variable value step by step, 2) a powerful cell-ordering heuristic is introduced, 3) a branch-and-bound search that incorporates forward-checking is performed, and 4) the limited discrepancy search is introduced to improve the chance of finding a solution in a limited amount of search. Experimental evaluations using standard benchmark problems show that this algorithm can find optimal or semi-optimal solutions for these problems, and most of the obtained solutions are better than or equivalent to those of existing methods using simulated annealing, tabu search, or neural networks. These results show that state-of-the-art constraint satisfaction/optimization techniques are capable of solving realistic application problems when equipped with an appropriate problem representation and heuristics.

AB - This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint satisfaction techniques. The characteristics of this algorithm are as follows: 1) instead of representing each call in a cell (a unit area in providing communication services) as a variable, we represent a cell (which has multiple calls) as a variable that has a very large domain, and determine a variable value step by step, 2) a powerful cell-ordering heuristic is introduced, 3) a branch-and-bound search that incorporates forward-checking is performed, and 4) the limited discrepancy search is introduced to improve the chance of finding a solution in a limited amount of search. Experimental evaluations using standard benchmark problems show that this algorithm can find optimal or semi-optimal solutions for these problems, and most of the obtained solutions are better than or equivalent to those of existing methods using simulated annealing, tabu search, or neural networks. These results show that state-of-the-art constraint satisfaction/optimization techniques are capable of solving realistic application problems when equipped with an appropriate problem representation and heuristics.

UR - http://www.scopus.com/inward/record.url?scp=0033701201&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033701201&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0033701201

VL - 2

SP - 888

EP - 894

JO - IEEE Vehicular Technology Conference

JF - IEEE Vehicular Technology Conference

SN - 0740-0551

ER -