Genetic algorithm for extended cell assignment problem in wireless ATM network

Der Rong Din, Shian Shyong Tseng, Mon Fong Jiang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


In this paper, we investigate the extended cell assignment problem which optimally assigns new and split cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches in an ATM network (whose locations are fixed and known), the problem is assigning cells to switches in an optimum manner. We would like to do the assignment in as attempt to minimize a cost criterion. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is modeled as a complex integer programming problem and finding an optimal solution to this problem is NP-complete. A stochastic search method, based on a genetic approach is proposed to solve this problem. Simulation results showtha t genetic algorithm is robust for this problem.

Original languageEnglish
Title of host publicationAdvances in Computing Science - ASIAN 2000 - 6th Asian Computing Science Conference, Proceedings
EditorsJifeng He, Masahiko Sato
PublisherSpringer Verlag
Number of pages19
ISBN (Print)3540414282, 9783540414285
Publication statusPublished - 2000
Event6th Asian Computing Science Conference, ASIAN 2000 - Penang, Malaysia
Duration: 2000 Nov 252000 Nov 27

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other6th Asian Computing Science Conference, ASIAN 2000

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Genetic algorithm for extended cell assignment problem in wireless ATM network'. Together they form a unique fingerprint.

Cite this