Solving Constrained Mirror Placement Problem Based on Heuristic Genetic Algorithm in Internet

GUO Chang-jie; ZHONG Yu-zhuo; LIN Chuang

您当前的位置：

首页 >

文章列表页 >

Solving Constrained Mirror Placement Problem Based on Heuristic Genetic Algorithm in Internet

更新时间：2025-07-16

- Solving Constrained Mirror Placement Problem Based on Heuristic Genetic Algorithm in Internet
- Acta Electronica Sinica Vol. 30, Issue 5, Pages: 689-693(2002)
- 作者机构：
  
  清华大学计算机系,北京,100084
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393
- Published：2002
- 稿件说明：
移动端阅览
GUO Chang-jie, ZHONG Yu-zhuo, LIN Chuang. Solving Constrained Mirror Placement Problem Based on Heuristic Genetic Algorithm in Internet[J]. Acta Electronica Sinica, 2002, 30(5): 689-693.
DOI：

GUO Chang-jie, ZHONG Yu-zhuo, LIN Chuang. Solving Constrained Mirror Placement Problem Based on Heuristic Genetic Algorithm in Internet[J]. Acta Electronica Sinica, 2002, 30(5): 689-693. DOI：

摘要

求解受限镜像放置问题对于Internet内容提供商具有重要的应用价值

但其在数学上归结为

-supplier问题

是一个NPC问题.本文提出了一种求解受限镜像放置问题的启发式遗传算法

该算法采用启发式交叉和变异算子

本质上是对标准两点交叉和单点变异产生的非法染色体进行启发式修正

以提高算法的局部搜索能力

加速收敛.仿真实验详细考察了启发式算子对收敛速度与全局优化性能的影响

并与两种常用启发式算法进行了性能比较.实验结果表明本文算法具有快速收敛

高性能

全局收敛等优点

证明其可行性和有效性.

Abstract

Solving constrained mirror placement problem is very valuable to content providers in Internet.Constrained mirror placement problem can be modeled as a

-supplier problem

which belongs to NP-Complete problem and has only best possible 3-approximate algorithm.A heuristic genetic algorithm is presented in this paper

which uses the heuristic algorithm to revise the new illegal chromosome generated by standard two-points crossover and one-point mutation operations.The simulation results suggest that the algorithm is feasible and effective.

关键词

Keywords

references

Views

849

下载量

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

⁰