检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马俊祥[1,2] 赵振宙 玛尔瓦提·黑扎提[1,3] 郑康乐 张爽 吴昊 张克凡 MA Junxiang;ZHAO Zhenzhou;HEIZHATI Maerwati;ZHENG Kange;ZHANG Shuang;WU Hao;ZHANG Kefan(School of Renewable Energy,Hohai University,Nanjing 211100,China;Henan Clean Energy Branch of Huaneng International Power Co.,Ltd.,Zhengzhou 450000,China;China Power Construction Chongqing Survey and Design Institute Co.Ltd.,Chongqing 401120,China;Huaneng Linhe thermal power plant,Inner Mongolia Bayannaoer 015000,China)
机构地区:[1]河海大学新能源学院,南京211100 [2]华能国际电力股份有限公司河南清洁能源分公司,郑州450000 [3]中电建重庆勘测设计研究院有限公司,重庆401120 [4]华能临河热电厂,内蒙古巴彦淖尔015000
出 处:《内蒙古工业大学学报(自然科学版)》2024年第1期48-55,共8页Journal of Inner Mongolia University of Technology:Natural Science Edition
基 金:国家自然科学基金项目(52376179,51876054)。
摘 要:以某山区风电场为研究对象,基于最短路径Dijkstra算法,以风电场场内新建道路路径和电缆长度最短为优化目标,建立了满足山区风电场的道路纵坡坡度、最小转弯半径、敏感区、边界、桩距等约束条件的选线算法,该算法的特点一是采用规则三角网格和对角距启发式函数来搜寻六个方向,满足最小转弯半径的要求,大大提高了算法便捷性。二是算法分两步进行,第一步针对主线道路服务,仅输入需要优化的道路的起止点,即可获得两点的最短路径;第二步针对支线道路服务,以第一步得到的主线道路为已有道路,只需要输入支线道路抹点(机位点坐标)坐标,即可自动寻索到该点距离主线道路的最短路径。研究结果可为实际的风电场建设前期工作提供重要的过程指导。Taking a mountainous wind farm as the research object,based on the shortest path Dijkstra algorithm,with the shortest new road path and cable length in the wind farm field as the optimization goal,a route selection algorithm is established to meet the constraints of road longitudinal slope gradient,minimum turning radius,sensitive area,boundary and pile distance.The algorithm has the following characteristics.First,the regular triangular grid and the diagonal distance heuristic function are used to search six directions to meet the requirements of the minimum turning radius,which greatly improves the convenience of the algorithm.Secondly,the algorithm is divided into two steps.The first step is for the main road service,and the shortest path of the two points can be obtained when the start and end points of the road to be optimized are input.The second step is for the feeder road service.With the main road from the first step as the existing road,the shortest path of the distance from the main road to the end point can be obtained automatically when the coordinates of the feeder road end point(coordinates of tower locations)are input.The research results of this paper can provide important process guidance for the preliminary work of actual wind farm construction.
分 类 号:TK81[动力工程及工程热物理—流体机械及工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222