### Abstract

In this paper, we investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum manner. 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 model as dual-homing cell assignment problem, which is a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a stochastic search method, based on a genetic approach, is proposed to solve this problem. In this paper, domain-dependent heuristics are encoded into crossover operations, mutations of genetic algorithm (GA) to solve this problem. Simulation results show that GA is robust for this problem.

Original language | English |
---|---|

Pages (from-to) | 1536-1547 |

Number of pages | 12 |

Journal | Computer Communications |

Volume | 25 |

Issue number | 17 |

DOIs | |

Publication status | Published - 2002 Nov 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

*Computer Communications*,

*25*(17), 1536-1547. https://doi.org/10.1016/S0140-3664(02)00086-5

}

*Computer Communications*, vol. 25, no. 17, pp. 1536-1547. https://doi.org/10.1016/S0140-3664(02)00086-5

**A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network.** / Din, D. R.; Tseng, S. S.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network

AU - Din, D. R.

AU - Tseng, S. S.

PY - 2002/11/1

Y1 - 2002/11/1

N2 - In this paper, we investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum manner. 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 model as dual-homing cell assignment problem, which is a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a stochastic search method, based on a genetic approach, is proposed to solve this problem. In this paper, domain-dependent heuristics are encoded into crossover operations, mutations of genetic algorithm (GA) to solve this problem. Simulation results show that GA is robust for this problem.

AB - In this paper, we investigate the optimal assignment problem, which assigns cells in Personal Communication Service to switches on Asynchronous Transfer Mode network in an optimum manner. 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 model as dual-homing cell assignment problem, which is a complex integer programming problem. Since finding an optimal solution of this problem is NP-hard, a stochastic search method, based on a genetic approach, is proposed to solve this problem. In this paper, domain-dependent heuristics are encoded into crossover operations, mutations of genetic algorithm (GA) to solve this problem. Simulation results show that GA is robust for this problem.

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

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

U2 - 10.1016/S0140-3664(02)00086-5

DO - 10.1016/S0140-3664(02)00086-5

M3 - Article

VL - 25

SP - 1536

EP - 1547

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 17

ER -