### 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 language | English |
---|---|

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

Pages | 1138-1147 |

Number of pages | 10 |

Volume | 4570 LNAI |

Publication status | Published - 2007 Dec 24 |

Event | 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007 - Kyoto, Japan Duration: 2007 Jun 26 → 2007 Jun 29 |

### Publication series

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

Volume | 4570 LNAI |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE-2007 |
---|---|

Country | Japan |

City | Kyoto |

Period | 07-06-26 → 07-06-29 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Biochemistry, Genetics and Molecular Biology(all)
- Computer Science(all)
- Theoretical Computer Science

### Cite this

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

}

*New Trends in Applied Artificial Intelligence - 20th International Conference on Industrial, Engineering, and Other Applications of Applied Intelligent Systems, lEA/AlE 2007, Proceedings.*vol. 4570 LNAI, 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.

Research output: Chapter in Book/Report/Conference proceeding › Conference 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

SN - 9783540733225

VL - 4570 LNAI

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 -