运筹与管理Issue(2)：64-70,7.
三维欧氏 Steiner 最小树的 Delaunay 四面体网格混合智能算法
A Hybrid Intelligent Algorithm Based on Delaunay Tetrahedron Mesh Generation for Euclidean Steiner Minimum Tree Problem in 3-space
摘要
Abstract
Euclidean Steiner minimum tree problem , a classical NP-hard problem in combination optimization , has been widely studied in many fields .Euclidean Steiner minimal tree problem in 3-space is the generalization of Euclidean Steiner minimum tree problem in 2-space .The research results on Euclidean Steiner minimal tree problem in 3-space have been rarely published because of their difficulties .In this paper , a hybrid intelligent method is designed by using Delaunay tetrahedron mesh generation technology to solve the Euclidean Steiner min -imal tree problem in 3-space , which can not only avoid falling into local optima , but also has good effects in solving large scale problems .Promising results are obtained by using this hybrid method coded in MATLAB to solve series of Euclidean Steiner minimum tree problem instances in 3-space .关键词
三维欧氏Steiner最小树/Delaunay四面体网格/凸多面体剖分/智能算法Key words
euclidean steiner minimum tree problem in 3-space/delaunay tetrahedron mesh generation/convex polyhedron decomposition/intelligent algorithm分类
信息技术与安全科学引用本文复制引用
王家桢,马良,张惠珍..三维欧氏 Steiner 最小树的 Delaunay 四面体网格混合智能算法[J].运筹与管理,2015,(2):64-70,7.基金项目
上海市一流学科建设资助项目（S1201YLXK）；上海市教育委员会科研创新项目（14YZ090）；高等学校博士学科点专项科研基金联合资助课题（20123120120005）；上海高校青年教师培养资助计划（slg12010）；上海理工大学博士科研启动项目 （）
