Simulated annealing algorithm for solving network expanded problem in wireless ATM network

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

Abstract

In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of cells (or Base Stations, BSs) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches of the new ATM backbone network in an optimal manner. The goal is to do the expansion in an attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modelled as a complex integer programming problem. Since finding an optimal solution to this problem is Impractical. A simulated annealing (SA) algorithm is proposed to solve this problem. In the proposed SA, several heuristics are encoded into the perturbation to generate good solutions. Experimental results indicate that the proposed simulated annealing algorithm can get better performance than heuristic algorithm.

Original languageEnglish
Title of host publicationNew Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings
Pages1138-1147
Number of pages10
Publication statusPublished - 2007 Dec 24
Event20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007 - Kyoto, Japan
Duration: 2007 Jun 262007 Jun 29

Publication series

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

Other

Other20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007
CountryJapan
CityKyoto
Period07-06-2607-06-29

Fingerprint

Asynchronous transfer mode
Simulated Annealing Algorithm
Simulated annealing
Communication
Switches
Personal communication systems
Switch
Backbone
Budgets
Topology
Integer programming
Heuristic algorithms
Costs and Cost Analysis
Base stations
Cell
Transfer (Psychology)
Budget Constraint
Capacity Constraints
Communication Cost
Integer Programming

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Din, D-R. (2007). Simulated annealing algorithm for solving network expanded problem in wireless ATM network. In New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings (pp. 1138-1147). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4570 LNAI).
Din, Der-Rong. / Simulated annealing algorithm for solving network expanded problem in wireless ATM network. New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. 2007. pp. 1138-1147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9ad96109bcd2485695f0c7043895322b,
title = "Simulated annealing algorithm for solving network expanded problem in wireless ATM network",
abstract = "In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of cells (or Base Stations, BSs) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches of the new ATM backbone network in an optimal manner. The goal is to do the expansion in an attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modelled as a complex integer programming problem. Since finding an optimal solution to this problem is Impractical. A simulated annealing (SA) algorithm is proposed to solve this problem. In the proposed SA, several heuristics are encoded into the perturbation to generate good solutions. Experimental results indicate that the proposed simulated annealing algorithm can get better performance than heuristic algorithm.",
author = "Der-Rong Din",
year = "2007",
month = "12",
day = "24",
language = "English",
isbn = "9783540733225",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "1138--1147",
booktitle = "New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings",

}

Din, D-R 2007, Simulated annealing algorithm for solving network expanded problem in wireless ATM network. in New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4570 LNAI, pp. 1138-1147, 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007, Kyoto, Japan, 07-06-26.

Simulated annealing algorithm for solving network expanded problem in wireless ATM network. / Din, Der-Rong.

New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. 2007. p. 1138-1147 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4570 LNAI).

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

TY - GEN

T1 - Simulated annealing algorithm for solving network expanded problem in wireless ATM network

AU - Din, Der-Rong

PY - 2007/12/24

Y1 - 2007/12/24

N2 - In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of cells (or Base Stations, BSs) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches of the new ATM backbone network in an optimal manner. The goal is to do the expansion in an attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modelled as a complex integer programming problem. Since finding an optimal solution to this problem is Impractical. A simulated annealing (SA) algorithm is proposed to solve this problem. In the proposed SA, several heuristics are encoded into the perturbation to generate good solutions. Experimental results indicate that the proposed simulated annealing algorithm can get better performance than heuristic algorithm.

AB - In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of cells (or Base Stations, BSs) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches of the new ATM backbone network in an optimal manner. The goal is to do the expansion in an attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modelled as a complex integer programming problem. Since finding an optimal solution to this problem is Impractical. A simulated annealing (SA) algorithm is proposed to solve this problem. In the proposed SA, several heuristics are encoded into the perturbation to generate good solutions. Experimental results indicate that the proposed simulated annealing algorithm can get better performance than heuristic algorithm.

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

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

M3 - Conference contribution

AN - SCOPUS:37249034223

SN - 9783540733225

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1138

EP - 1147

BT - New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings

ER -

Din D-R. Simulated annealing algorithm for solving network expanded problem in wireless ATM network. In New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings. 2007. p. 1138-1147. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).