在“三跨”输电线路张力放线施工中,一旦发生事故被牵导线可能跌落冲击下方跨越网,威胁被跨越物的安全稳定运行,因此提出一种基于激光点云与建筑信息模型(building information modeling,BIM)技术的“三跨”施工跨越网动力学响应分析方...在“三跨”输电线路张力放线施工中,一旦发生事故被牵导线可能跌落冲击下方跨越网,威胁被跨越物的安全稳定运行,因此提出一种基于激光点云与建筑信息模型(building information modeling,BIM)技术的“三跨”施工跨越网动力学响应分析方法。首先利用机载激光雷达采集“三跨”施工现场的三维点云数据,使用改进的布料模拟滤波算法分割得到跨越地形点云数据,使用基于点云空间维度特征与K-Means算法实现对跨越档两侧杆塔点云数据的高精度提取;其次根据提取的点云数据结合BIM技术对目标设备及施工环境进行逆向建模,通过不同地表物体的组装堆砌,并在其上搭建施工跨越网模型;最后通过模拟事故发生时导线对跨越网的冲击碰撞,探测跨越网的承载性能及其与被跨越物之间的动态净空距离。结果表明,该方法能够提前在实际施工环境中对跨越网的动力学性能进行分析,为输电线路跨越施工提供可靠的安全保障及数据支撑,具有一定的工程价值。展开更多
An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effecti...An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.展开更多
To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding ker...To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.展开更多
文摘在“三跨”输电线路张力放线施工中,一旦发生事故被牵导线可能跌落冲击下方跨越网,威胁被跨越物的安全稳定运行,因此提出一种基于激光点云与建筑信息模型(building information modeling,BIM)技术的“三跨”施工跨越网动力学响应分析方法。首先利用机载激光雷达采集“三跨”施工现场的三维点云数据,使用改进的布料模拟滤波算法分割得到跨越地形点云数据,使用基于点云空间维度特征与K-Means算法实现对跨越档两侧杆塔点云数据的高精度提取;其次根据提取的点云数据结合BIM技术对目标设备及施工环境进行逆向建模,通过不同地表物体的组装堆砌,并在其上搭建施工跨越网模型;最后通过模拟事故发生时导线对跨越网的冲击碰撞,探测跨越网的承载性能及其与被跨越物之间的动态净空距离。结果表明,该方法能够提前在实际施工环境中对跨越网的动力学性能进行分析,为输电线路跨越施工提供可靠的安全保障及数据支撑,具有一定的工程价值。
基金Projects(61174040,61104178,61374136) supported by the National Natural Science Foundation of ChinaProject(12JC1403400) supported by Shanghai Commission of Science and Technology,ChinaProject supported by the Fundamental Research Funds for the Central Universities,China
文摘An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.
基金Project(60872005) supported by National Natural Science Foundation of China
文摘To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.
