期刊文献+

基于带线段的障碍城市Voronoi图的煤炭运输优化研究

Research on Coal Transportation Optimization Based on City Voronoi Diagram with Line Segment Obstacle
下载PDF
导出
摘要 如何能在最短时间将煤炭运送到目的地是煤炭运输问题研究的一个重要内容。在道路网络环境中,该问题可以转化为找到查询点的k个最近邻。在带线段障碍的城市Voronoi图基础上,给出k最近邻查询算法,能有效解决该问题。 How to transport coal to the destination in the shortest time is an important content in the coal transportation problems. In the road network environment, the problem can be transformed into a k-nearest neighbor query. To solve the problem,gives In k-nearest neighbor query algorithm on the basis of the city Voronoi diagram with Line Segment Obstacle ,which can solve the problem effectively.
作者 朱婧
出处 《煤炭技术》 CAS 北大核心 2013年第5期162-163,共2页 Coal Technology
基金 黑龙江省自然科学基金面上项目(F201008) 黑龙江省教育厅科学技术研究项目(12511610)
关键词 煤炭运输 城市Voronoi图 障碍城市Voronoi图 带线段的障碍城市Voronoi图 优化 coal transportation city Voronoi diagram city Voronoi diagram with obstacle city Voronoi diagram with line segment obstacle optimization
  • 相关文献

参考文献5

二级参考文献12

  • 1Kei Kobayashi, Kokichi Sugihara. Crystal Voronoi Diagram and Its Ap- plications to Collision-Free Paths. Lecture Notes in Computer Science, 2001:738 - 747.
  • 2Lingas A. Voronoi diagram with barriers and their applications. Manuscript, 1986.
  • 3Tane Pendragon, Lyndon While. Path-planning by Tessellation of Obstacles. Australian Computer Society,2003.
  • 4Vomnoi. Nouvelles applications des parameters continus a la theorie des formes quadratiques. Deuxieme Memoire : Recherches sur les parallelloedres primitives,J. Reine Angew. Math., 1908:134,198 - 287. 1909 : 136,67 - 181.
  • 5Dorigo M, Bocabea u E, Theraola G. Ant Algorithms and Stigmergy [ J ]. Future Generation Computer System, 2000,16: 851-871.
  • 6Maniezzo V, Colorni A. The Ant System Applied to the Quadratic Assignment Problem [ J ]. IEEE Trans on Knowledge and Data Engineering, 1999, 1 (5): 769-778.
  • 7Colorni A, Dorigo M, Maniezzo V, Trbian M. Ant System for Job-shop Scheduling [J]. Belgian Joumal Operations Research Statistic Computation Science, 1994, 34: 39-53.
  • 8Maniezzo V, Carbonaro A. An Ants Heuristic for the Frequency Assignment Problem [J]. Future Generation Computer System, 2000, 16: 927-935.
  • 9谢政,多磊,汤泽滢.带容量限制和手续费用的运输问题[J].系统工程,1998,16(5):25-31. 被引量:12
  • 10马良.来自昆虫世界的寻优策略——蚂蚁算法[J].自然杂志,1999,21(3):161-163. 被引量:89

共引文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部