| 干线网络的选址问题研究 |
| |
| 引用本文： | 王福昌,曹慧荣,张丽娟. 干线网络的选址问题研究[J]. 数学的实践与认识, 2010, 40(7) |
| |
| 作者姓名： | 王福昌 曹慧荣 张丽娟 |
| |
| 作者单位： | 1. 中国地震局防灾科技学院基础部,河北三河,065201
2. 廊坊师范学院数信学院,河北廊坊,065000 |
| |
| 基金项目： | 河北省教育厅自然科学研究项目(Z2009106) |
| |
| 摘 要： | 考虑平面上和三维空间中同时确定多条干线的干线网络选址问题.对于平面上情形,通过最小化每个点到离它最近干线的加权距离之和,给出了一种有限步终止算法和基于k-means聚类分析、加权全最小一乘和重抽样方法的线性类算法;对于空间情形,给出了线性聚类算法.通过计算机仿真说明以上算法可以有效地确定平面和空间中干线网络位置.
|
| 关 键 词： | 干线网络选址 加权全最小一乘 线性聚类分析 重抽样 |
Location Problems of Selecting Main Line Networks |
| |
| WANG Fu-chang,CAO hui-rong,ZHANG Li-juan. Location Problems of Selecting Main Line Networks[J]. Mathematics in Practice and Theory, 2010, 40(7) |
| |
| Authors: | WANG Fu-chang CAO hui-rong ZHANG Li-juan |
| |
| Affiliation: | WANG Fu-chang~1,CAO hui-rong~2,ZHANG Li-juan~1 (1.Institute of Disaster Prevention Science , Technology of CEA,Sanhe 065201,China) (2.College of Mathematics , Information Science,Langfang Normal College,Langfang 065000,China) |
| |
| Abstract: | Selecting an optimal main line networks in plane and three -dimensional space is considered.A finite step method and a new algorithm based on k-means clustering,weighted orthogonal least absoluted deviation and resampling are given which determine optimal main line networks to minimize the total weighted distances from n given points to its nearest lines in plane.A new algorithm based on k-means clustering,weighted orthogonal least absoluted deviation and resampling is given which determine optimal main lin... |
| |
| Keywords: | main line network location problems weighted total least absolute deviations approach linear grouping resampling |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
