A Genetic Algorithm for Solving the Problem of Routing and Capacity Assignment in Computer Communication Networks

Ye Dazhen and Wu Xinyu

您当前的位置：

首页 >

文章列表页 >

A Genetic Algorithm for Solving the Problem of Routing and Capacity Assignment in Computer Communication Networks

更新时间：2025-12-08

- A Genetic Algorithm for Solving the Problem of Routing and Capacity Assignment in Computer Communication Networks
- Acta Electronica Sinica Issue 12, (1996)
- 作者机构：
  
  南京邮电学院
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN913.2
- Published：1996
- 稿件说明：
移动端阅览
[1]叶大振,吴新余.计算机通信网中路由选择和容量分配问题的遗传算法求解[J].电子学报,1996(12):75-78.

Ye Dazhen and Wu Xinyu. A Genetic Algorithm for Solving the Problem of Routing and Capacity Assignment in Computer Communication Networks[J]. Acta Electronica Sinica, 1996, (12).
[1]叶大振,吴新余.计算机通信网中路由选择和容量分配问题的遗传算法求解[J].电子学报,1996(12):75-78. DOI：

Ye Dazhen and Wu Xinyu. A Genetic Algorithm for Solving the Problem of Routing and Capacity Assignment in Computer Communication Networks[J]. Acta Electronica Sinica, 1996, (12). DOI：

摘要

计算机通信网中，对路由选择和容量分配问题进行综合优化设计时的数学模型，是一个多约束条件的非线性０－１规划。本文以遗传算法的基本思想为基础，设计了一个求解该问题的遗传寻优算法，对计算机通信网优化设计实例的计算表明，这一方法能够迅速求出问题的全局近似最优解，并具有高的计算精确度。

Abstract

The problem of routing and capacity assignment in computer communication networks is a complicated nonlinear 0-1 programming. A new optimization method based on Genetic Algorithm for solving this problem is presented.Computing results of real examples of design of CCN demonstrate that with this method the near global optimal solution of the problem can be quickly obtained

and the solution thus obtained has high accuracy.

关键词

Keywords

references

Views

175

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Genetic Algorithm Based MIMO Equalization Parameter Optimization Technology for Mode-Division Multiplexed System

An Absorbing Structure Covering the Whole UHF Band

A Consortium Blockchain Based Reliable Task Offloading Approach in Edge Computing

An Approach to Multi-Path Coverage Testing Based on Key Edge Probability and Path Layer Proximity

One Hybrid Strategy for Automatic Placement and Routing of QCA Circuit

Related Author

ZHAO Tian-feng

WEN Feng

FENG Bian-xia

WU Bao-jian

XU Bo

QIU Kun

WU Chang-ying

GAO Yang

Related Institution

Key Laboratory of Optical Fiber Sensing and Communication Networks, Ministry of Education, University of Electronics Science and Technology of China

School of Electronics and Information， Northwestern Polytechnical University

Key Laboratory for Novel Software Technology， Nanjing University

Guangdong Provincial Laboratory of Artificial Intelligence and Digital Economy

College of Big Data and Intelligent Engineering， Southwest Forestry University

⁰