海洋科学考察可视化航次设计研究及应用
|
摘要
海洋科学考察耗资巨大,必须进行科学、合理的航次设计。航次设计内容复杂、多样,传统的手工设计模式费时、费力,且难以实施优化的航次设计,为此,对高效、科学的可视化设计模式进行研究十分必要。本文研究的目的是探索一种海洋科学考察可视化航次设计方法以提高航次设计的效率与科学性,在此基础上设计并实现实用的航次设计软件系统,为海洋科学考察服务,提高科考工作的技术水平。
对航次设计的内容、方法和流程进行了深入分析:航次设计内容主要包括考察目标、考察任务、作业任务和实施方案。首先确定考察目标,根据考察目标确定考察任务,将考察任务分解形成具体的作业任务集合,布设相应的测站和测线,并在此基础上进行实施方案规划,从而形成航次计划。其中,测站的布设分为针对式布站和探索式布站两种方式,测线的布设分为针对式布线、覆盖式布线和探索式布线三种方式。
在以上分析的基础上,主要进行了如下工作:为了实施自动化的航次设计,对航次设计内容进行了规范化设计,提出测线区和工作区两个概念以实现对测站和测线的规范化管理,在此基础上对航次信息进行了分类,提出了航次组织结构,并设计了标准航次报表格式以实现自动输出;为了实施可视化的航次设计,利用地理信息系统(GIS)技术对港口、工作区、拐点、测站、测线区、测线、航线等航次空间对象进行了可视化抽象,提出了基于GIS技术和Flash技术的航次计划可视化仿真预演方法;为了实施优化的航次设计,利用Delaunay三角网描述点之间邻近关系的自适应性,提出了融合Delaunay三角网和遗传算法的优化算法;对航次设计系统的功能需求进行了分析,设计并利用Visual C++.NET、Microsoft FoundationClasses(MFC)、Microsoft Access、MapInfo MapX、Shockwave实现了该系统,并在DY115-19、DY115-20以及多个试验航次的计划设计中得到了成功应用。
本文研究具有以下主要特点:
(1)提出了海洋科学考察可视化航次设计的理论和方法;
(2)创造性地提出了融合Delaunay三角网和遗传算法的航次优化算法。
Scientific and reasonable plan should be made for ocean scientific survey because it is costly. As the contents of survey plan are complex and various, traditional handwork-planning is time-consuming and laborious, and it is difficult to make an optimized plan, so efficient and scientific visualization-planning should be studied. To improve the efficiency and scientificity of survey planning, a visual planning method for ocean scientific survey is studied, and practical visual palnning software system is designed and implemented for serving ocean scientific survey and improving its technical level.
Contents, methods and flows of survey planning are thoroughly analysed: the contents of survey planing include survey objective, survey missions, survey tasks and implementation scheme. Firstly, survey objective is set; secondly, survey missions are determined according to survey objective; thirdly, each survey mission is divided into several survey tasks, and corresponding stations and survey tracks are posted; lastly, implementation scheme is planned based on the above. There are two patterns of station posting: specifical posting and exploratory posting, and three patterns of survey track posting: specifical posting, coverall posting and exploratory posting.
Based on above analysis, the following main work is finished: contents of ocean scientific survey voyage are standardized for automatic planning, two concepts including survey track area and area are given for standardized management of stations and survey tracks, voyage information is classified, voyage structure is put forward, standarded formats of voyage report forms are designed for automatic output; spacial voyage objects including port, area, inflexion point, station, survey track area, survey track and lane are visually abstracted by using Geographical Information System(GIS) technology, simulation and rehearsal method of survey plan is given based on GIS technology and Flash technology; by utilizing the adaptability of Delaunay Triangulated Networks(DTN) expressing the adjacent relations among points, a new algorithm syncretizing DTN and Genetic Algorithms(GA) is raized for optimized planning; functional requirements of visual planning system are analysed, and the system is designed and implemented by using Visual C ++, Microsoft Foundation Class(MFC), Microsoft Access, Mapinfo MapX and Shockwave, and gets successful applications in survey plannings of DY115-19, DY115-20 and several trial voyages.
Main characteristics of our study are as follows:
(1) Theories and methods for visual planning of ocean scientific survey are given;
(2) Optimization algorithm syncretizing DTN and GA is creatively presented.
对航次设计的内容、方法和流程进行了深入分析:航次设计内容主要包括考察目标、考察任务、作业任务和实施方案。首先确定考察目标,根据考察目标确定考察任务,将考察任务分解形成具体的作业任务集合,布设相应的测站和测线,并在此基础上进行实施方案规划,从而形成航次计划。其中,测站的布设分为针对式布站和探索式布站两种方式,测线的布设分为针对式布线、覆盖式布线和探索式布线三种方式。
在以上分析的基础上,主要进行了如下工作:为了实施自动化的航次设计,对航次设计内容进行了规范化设计,提出测线区和工作区两个概念以实现对测站和测线的规范化管理,在此基础上对航次信息进行了分类,提出了航次组织结构,并设计了标准航次报表格式以实现自动输出;为了实施可视化的航次设计,利用地理信息系统(GIS)技术对港口、工作区、拐点、测站、测线区、测线、航线等航次空间对象进行了可视化抽象,提出了基于GIS技术和Flash技术的航次计划可视化仿真预演方法;为了实施优化的航次设计,利用Delaunay三角网描述点之间邻近关系的自适应性,提出了融合Delaunay三角网和遗传算法的优化算法;对航次设计系统的功能需求进行了分析,设计并利用Visual C++.NET、Microsoft FoundationClasses(MFC)、Microsoft Access、MapInfo MapX、Shockwave实现了该系统,并在DY115-19、DY115-20以及多个试验航次的计划设计中得到了成功应用。
本文研究具有以下主要特点:
(1)提出了海洋科学考察可视化航次设计的理论和方法;
(2)创造性地提出了融合Delaunay三角网和遗传算法的航次优化算法。
Scientific and reasonable plan should be made for ocean scientific survey because it is costly. As the contents of survey plan are complex and various, traditional handwork-planning is time-consuming and laborious, and it is difficult to make an optimized plan, so efficient and scientific visualization-planning should be studied. To improve the efficiency and scientificity of survey planning, a visual planning method for ocean scientific survey is studied, and practical visual palnning software system is designed and implemented for serving ocean scientific survey and improving its technical level.
Contents, methods and flows of survey planning are thoroughly analysed: the contents of survey planing include survey objective, survey missions, survey tasks and implementation scheme. Firstly, survey objective is set; secondly, survey missions are determined according to survey objective; thirdly, each survey mission is divided into several survey tasks, and corresponding stations and survey tracks are posted; lastly, implementation scheme is planned based on the above. There are two patterns of station posting: specifical posting and exploratory posting, and three patterns of survey track posting: specifical posting, coverall posting and exploratory posting.
Based on above analysis, the following main work is finished: contents of ocean scientific survey voyage are standardized for automatic planning, two concepts including survey track area and area are given for standardized management of stations and survey tracks, voyage information is classified, voyage structure is put forward, standarded formats of voyage report forms are designed for automatic output; spacial voyage objects including port, area, inflexion point, station, survey track area, survey track and lane are visually abstracted by using Geographical Information System(GIS) technology, simulation and rehearsal method of survey plan is given based on GIS technology and Flash technology; by utilizing the adaptability of Delaunay Triangulated Networks(DTN) expressing the adjacent relations among points, a new algorithm syncretizing DTN and Genetic Algorithms(GA) is raized for optimized planning; functional requirements of visual planning system are analysed, and the system is designed and implemented by using Visual C ++, Microsoft Foundation Class(MFC), Microsoft Access, Mapinfo MapX and Shockwave, and gets successful applications in survey plannings of DY115-19, DY115-20 and several trial voyages.
Main characteristics of our study are as follows:
(1) Theories and methods for visual planning of ocean scientific survey are given;
(2) Optimization algorithm syncretizing DTN and GA is creatively presented.
引文
1.艾自兴,龙毅.计算机地图制图[M].武汉:武汉大学出版社,2005.
2.陈国良,王煦法,庄镇泉,等.遗传算法及其应用[M].北京:人民邮电出版社,2001.
3.陈惠玲,李振韶.我国首次获得深海热液硫化物和极端环境下的生物样品[EB/OL].http://old.cgs.gov.cn/NEWS/Geology%20News/2005/20050922/20050922001.htm,2005-09-22.
4.陈述彭,鲁学军,周成虎.地理信息系统导论[M].北京:科学出版社,1999.
5.陈志平,徐宗本.计算机数学——计算复杂性理论与NPC、NP难问题的求解(第一版)[M].北京:科学出版社,2001.
6.冯剑,岳琪.模拟退火算法求解TSP问题[J].森林工程,2008,24(1):94-96.
7.龚建华,林珲,肖乐斌,等.地学可视化探讨[J].遥感学报,1999,3(3):236-244.
8.国家海洋局,科学技术部,国防科学技术工业委员会等.国家“十一五”海洋科学和技术发展规划纲要[EB/OL].http://www.soa.gov.cn/hyjww/xzwgk/gjhyjwj/hykj/webinfo/2008/09/1252915436076518.htm,2009-09-17.
9.国务院.国务院关于印发全国海洋经济发展规划纲要的通知[EB/OL].http://www.gov.cn/zwgk/2005-08/13/content_22246.htm,2005-08-13.
10.何幼林,欧福军,魏华实等.蚁群算法的原理及其在组合优化中的应用[J].黑龙江科技信息,2008,(1):33.
11.胡圣武.地图学[M].北京:北京交通大学出版社,2008.
12.焦健,曾琪明.地图学[M].北京.北京大学出版社,2005.
13.金星姬,贾炜玮.人工神经网络研究概述[J].林业科技情报,2008,40(1):65.
14.金永明.日本《海洋基本计划草案》概要[N].中国海洋报,2008-3-11(3).
15.孔秀英,周晓馥,崔淑芹.达尔文的进化论与作物遗传育种[J].松辽学刊(自然科学版),1994,(1):88-90.
16.李松,李瑞彩,刘兴.基于改进禁忌搜索算法的车辆路径优化[J].铁道运输与经济,2008,30(5):91-94.
17.廖克,简灿良,傅肃性,等.地球信息科学导论[M].北京:科学出版社,2007.
18.廖卫华,张涛.中国完成首次环球大洋科考[EB/OL].http://www.thebeijingnews.com/news/china/2006/0123/013@156875.htm,2006-01-23
19.李建松.地理信息系统原理[M].武汉:武汉大学出版社,2006.
20.李连营,李清泉,李汉武,等.基于MapX的GIS应用开发[M].武汉:武汉大学出版社,2003.
21.李敏强,寇纪淞,林丹,等.遗传算法的基本理论与应用[M].北京:科学出版社,2002.
22.刘勇,康立山,陈毓屏.非数值并行计算方法——遗传算法[M].北京:科学出版社,1998.
23.刘光.地理信息系统二次开发教程——组建篇[M].北京:清华大学出版社,2003.
24.刘宁钟,杨静宇.遗传算法和Hopfield模型求解货郎担问题的比较和分析[J].计算机工程与应用,2003,(4):95-97.
25.刘于江,泽峰.种求解旅行商问题的禁忌搜索算法[J].江西理工大学学报,2006,27(4):38-40.
26.罗云启,曾琨,罗毅.数字化地理信息系统建设与MapInfo高级应用[M].北京:清华大学出版社,2003.
27.马良.旅行推销员问题的算法综述[J].数学的实践与认识,2000,30(2):156-165.
28.马思根,何明勤.应用型GIS的开发模式及其发展趋势[J].计算机与现代化,2009,(5):65-72.
29.莫鸿强.遗传算法搜索能力和编码方式研究[D].[博士学位论文].广州:华南理工大学,2001.
30.宁爱兵,马良.对称型TSP下界的快速估算法[J].系统工程理论与实践,2004,24(12):84-99.
31.彭仪普,刘文熙.Delaunay三角网与Voronoi图在GIS中的应用研究[J].测绘工程,2002,11(3):39-41.
32.齐锐,屈韶林,阳琳赞.用MapX开发地理信息系统[M].北京:清华大学出版社,2003.
33.秦姝,王锦彪.狭义TSP小窗口蚁群算法研究[J].计算机工程与应用,2008,44(12):45-46.
34.任建国.我国海洋科学“十一五”发展战略与优先资助领域[J].中国科学基金,2007,21(1):7-13.
35.宋学春,平凭.我国“大洋一号”科学考察船胜利返航[EB/OL].http://www.people.com.cn/GB/keji/1056/2255299.html,2003-12-19.
36.孙湫词,刘莉莉.我国在东太平洋首次发现海底热液活动区[EB/OL].http://www.zj.xinhuanet.com/newscenter/2008-08/26/content_14229359.htm,2008-08-26.
37.汪存富,蔚承建.一种新的求解ATSP问题的PBIL算法[J].计算机工程与应用,2005,41(27):66-68.
38.王鹏,刘立娜,潘成鹤.GIS中Delaunay三角网的快速建立及拓扑自动生成[J].测绘信息与工程,2001,(4):24-27.
39.王希浩,赵建军.应用型GIS的开发管理与过程设计[J].海军航空工程学院学报,2005,20(2):298-300.
40.王小平,曹立明.遗传算法——理论、应用与软件实现[M].西安:西安交通大学出版社,2002.
41.王志明.船舶航次计划安全评价体系及其软件系统[J].上海海事大学学报,2005,26(1):19-21.
42.武晓波,王世新,肖春生.一种生成Delaunay三角网的合成算法[J].遥感学 报,2000,4(1):32-35.
43.吴信才.地理信息系统原理、方法及应用[M].武汉:中国地质大学出版社,1998.
44.邬伦,刘瑜,张晶,等.地理信息系统——原理、方法和应用[M].北京:科学出版社,2001.
45.肖潇.GIS应用软件开发模式分析[J].计算机与现代化,2007,(9):51-53.
46.邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,1999.
47.徐冬梅.“海洋四号”海底探宝船返航 取得4项成果[EB/OL].http://www.people.com.cn/GB/keji/1057/2169395.html,2003-11-04.
48.徐鸿儒.中国海洋学史[M].济南:山东教育出版社,2004.
49.许肖梅.海洋技术概论[M].北京:北京出版社,2000.
50.徐质斌.中国海洋经济发展战略研究[M].广州:广东经济出版社,2007.
51.严晨,王直杰.以TSP为代表的组合优化问题研究现状与展望[J].计算机仿真,2007,24(6):171-174.
52.严蔚敏,吴伟民.数据结构(C语言版)[M].北京:清华大学出版社,1997.
53.杨芙清,梅宏,李克勤.软件复用与软件构件技术[J].电子学报,1999,27(2):68-75.
54.杨金森.海洋强国兴衰史略[M].北京:海洋出版社,2007.
55.杨若黎,顾基发.一种高效的模拟退火全局优化算法[J].系统工程理论与实践,1997,17(5):30-33.
56.尹旭日,张武军.Visual C++环境下MapX的开发技术[M].北京:冶金工业出版社,2009.
57.张炳炎.我国海洋调查船的现状与未来[J].世界科技研究与发展,1998,20(4):36-43.
58.张海荣.地理信息系统原理与应用[M].徐州:中国矿业大学出版社,2008.
59.章孝灿,黄智才,戴企成,等.GIS中基于拓扑结构和凸壳技术的快速TIN生成算法[J].计算机学报,2002,25(11):1212-1218.
60.张晓缋,方浩,戴冠中.遗传算法的编码机制研究[J].信息与控制,1997,26(2):134-139.
61.赵盾,程洁.达尔文进化论的历史考察[J].哈尔滨学院学报,2003,24(3):116-119.
62.赵会丽.应用型GIS的开发[J].河南科技,2006,(4):28-29.
63.周明,孙树栋.遗传算法原理及应用[M].北京:国防工业出版社1999.
64.祝国瑞.地图学[M].武汉:武汉大学出版社,2004.
65.朱晓东,陈晓玲,唐正东.人类生存与发展的新时空:海洋世纪[M].武汉:湖北教育出版社,1999.
66.Aiyer S V B,Niranjan M,Fallside F.A Theoretical Investigation into the Performance of the Hopfield Model[J].IEEE Transactions on Neural Networks,1990,1(2):204-215.
67.Blaser M.A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality[J].ACM Transactions on Algorithms,2008,4(4):47.
68.Colorni A,Dorigo M,Maniezzo V.Distributed Optimization by Ant Colonies[C].Proceedings of ECAL-91——European Conference on Artificial Life.Amsterdam:Elsevier Publishing,1991.134-142.
69. Delaunay B.Sur la sphere vide[J]. Bulletin of the Academy of Science of the USSR, 1934, (6),793-800.
70. Dorigo M.Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale(Optimization, Learning and Natural Algorithms)[D]. [Ph. D. Thesis]. Milano: Politecnico di Milano, 1992.
71. Colorni A,Dorigo M, Maniezzo V. An Investigation of Some Properties of an Ant Algorithm[C]. Proceedings of the Parallel Problem Solving from Nature Conference. Amsterdam:Elsevier Publishing, 1992.509-520.
72. Colorni A, Dorigo M. Maff ioli F, et al. Heuristics from Nature for Hard Combinatorial Optimization Problems[J]. International Transactions in Operational Research, 1996, 3(1): 1-21.
73. Dinabandhu B, Nikhil R P, Sankar K P. Direct Mutation in Genetic Algorithms[J]. Information Sciences,1994, 79(3):251-170.
74. Dorigo M, Gambardella L M. Ant Colony Systenna Cooperative Learning Approach To the Traveling Salesman Problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66.
75. Ejov V, Filar J A, Haythorpe M, et al. Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem[J]. Mathematics of Operations Research, 2009, 34(3):758-768.
76. Garey M R, Johnson D S. Computers and intractability[M]. San Francisco:W. H.Freeman, 1979.
77. Gierman D M, Ryerson R A, Moran G, et al. Remote Sensing and Canada Geographic Information System(CGIS) for Impact Studies[C]. Proceedings of the 3rd Canadian Symposium on Remote Sensing. Ottawa:Canadian Aeronautics and Space Institute, 1975.235-241.
78. Glover F. Future Paths for Integer Programming and Links to Artificial Intelligence[J]. Computers & Operations Research, 1986, 13(5):533 - 549.
79. Goldberg D E. Genetiic Algorithms in Search, Optimization and Machine Learning[M]. MA:Addison-wesley Professional, 1989.
80. Goodchild M F. Geographical Information Science[J]. International Journal of Geographical Information Science, 1992,6(1):31—45.
81. Hung R W, Chang M S, Feng D D, et al.The Hamiltonian Cycle Problem on Circular-Arc Graphs[C]. International Multiconference of Engineers and Computer Scientists. Hong Kong:INT ASSOC ENGINEERS-IAENG, 2009. 630-637.
82. International Maritime Organization. Guidelines for Voyage Planning——Resolution A. 893(21)[EB/OL].http://www. imo. org/includes/blastData. asp/doc_id=10712/893(21). pdf, 1999-11-2 5.
83. Holland J H. Adaptation in Natural and Artificial Systems[M]. Ann Arbor, MI:The University of Michigan Press,1975.
84. Hopfield J J, Tank D W. "Neural" computation of decisions in optimization problems[J]. Biological Cybernetics. 1985, 52(3):141-152.
85. Kirkpatrick S, Gelatt C D,Vecchi M P. Optimization by Simulated Anneal ing[J]. Science, 1983, 220:671-680.
86. Kitano H. Empirical Studies on the Speed of Convergence of the Neural Network Training by Genetic Algorithm[C]. Proceedings of The Eighth National Conference on Artificial Intelligence. Cambridge:MIT Press, 1990. 789-295.
87. Lin S, Kernighan B W. An Effective Heuristic Algorithm for the Traveling-Salesman Problem[J]. Operations Research, 1973,21(2) :498-516.
88. Lingas A. The Greedy and Delaunay Triangulations are not Bad in the Average Case[J]. Information Processing Lectures, 1986, 22(1) :25-31.
89. Liu S B, Ng K M, Ong H L. A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem[C]. Proceedings of World Academy of Science, Engineering and Technology. Canakkale: WORLD ACAD SCI, ENG & TECH-WASET, 2007. 267-271.
90. Maplnfo Corporation. Maplnfo MapX Developer' s Guide[EB/OL]. http://reference. mapinfo. com/common/docs/mapx/MapX_50_DevGuide.pdf, 2002.
91. Metropolis N, Rosenbluth A W, Rosenbluth M N, et al. Equations of State Calculation by Fast Computing Machines[J]. Journal of Chemical Physics,1953, (21) :1087-1092.
92. Miller C, Laflamme R.The DTM-Theory and applications[J]. Photogrammetric Engineering,1958, (24):433-442.
93. Montemanni R, Smith D H, Gambardella L M. A heuristic manipulation technique for the sequential ordering problem[J]. Computers & Operations Research, 2008, 35(12):3931-3944.
94. NOAA. U. S. Ocean Action Plan[EB/OL]. http://ocean. ceq. gov/actionplan. pdf, 2005.
95. NERC. Ocean 2025-Harnessing Marine Research for the Future[EB/OL].http://www. nerc. ac. uk/press/releases/2007/02-oceans2025. asp, 2007-01-10.
96. Pelikan J, Korenar V, Melnicek S. Using Cuts for the Traveling Salesman Problem and the Vehicle Routing Problem[C]. Proceedings of the 22nd International Conference on Mathematical Methods in Economics. Brno:Masarykova University, 2004.248-255.
97. Potvin J Y, Rousseaua JM. Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows[J]. European Journal of Operational Research, 1993, 66(3):331-340.
98. Reeves C R. Mordern Heuristic Techniques for Combinatorial Problems[M]. Oxford:Blackwell Scientific Publications, 1993.
99. Rndolph G. Convergence Analysis of Canonical Genetic Algorithms[J]. IEEE Transactions on Neural Networks,1994, 5(1):96-101.
100. Serra M, Venini P. On Some Applications of Ant Colony Optimization Metaheuristic to Plane Truss optimization[J].Structural and Multidisciplinary Optimization, 2006, 32(6):499-506.
101. Sharon M M, Melody D H, Jerry G. Ocean Survey Planning and Tracking: Integrating Technology to Support Naval Operations[C]. Proceedings of the 20th Annual ESRI International User Conference. Redlands:ESRI Press, 2000.
102. Whitley D, Hanson T. Optimizing Neural Networks Using Faster, More Accurate Genetic Search[C]. Proceedings of the Third International Conference on Genetic Algorithms. San Francisco:Morgan Kaufmann Publishers Incorporated, 1989. 391-396.
103. Whitley D, Starkweather T, Bogart C.Genetic Algorithms and Neural Networks: Optimizing Connections and Connectivity[J]. Parallel Computing, 1990, 14(3):347-361.
104. Wilson G V, Pawley G S. On the Stability of the Traveling Salesman Problem Algorithm of Hopfield and Tank[J]. Biological Cybernetics,1988, 58(1):63-70.
105. Voronoi G. Nouvelles Applications des Parameters Continus, a la Theorie des Formse Quadratiques, Duesieme Memoire:Recherches sur les Paralleloderes Primitifs[J]. Jounal fur die Reine und Angewandte Mathematic, 1908, (134) : 198-287.
106. Yeh C W. Solving Capacitated Vehicle Routing Problem Using DNA-based Computation[C]. Proceedings of 2009 International Conference on Information Management and Engineering. Los Alamitos:IEEE COMPUTER SOC, 2009. 170-174.
107. Yoon B, Holmes D J, Langholz G, et al. Efficient Genetic Algorithms for Training Layered Feed Forward Neural Networks[J]. Information Sciences, 1994, 76(1-2):67-85.
2.陈国良,王煦法,庄镇泉,等.遗传算法及其应用[M].北京:人民邮电出版社,2001.
3.陈惠玲,李振韶.我国首次获得深海热液硫化物和极端环境下的生物样品[EB/OL].http://old.cgs.gov.cn/NEWS/Geology%20News/2005/20050922/20050922001.htm,2005-09-22.
4.陈述彭,鲁学军,周成虎.地理信息系统导论[M].北京:科学出版社,1999.
5.陈志平,徐宗本.计算机数学——计算复杂性理论与NPC、NP难问题的求解(第一版)[M].北京:科学出版社,2001.
6.冯剑,岳琪.模拟退火算法求解TSP问题[J].森林工程,2008,24(1):94-96.
7.龚建华,林珲,肖乐斌,等.地学可视化探讨[J].遥感学报,1999,3(3):236-244.
8.国家海洋局,科学技术部,国防科学技术工业委员会等.国家“十一五”海洋科学和技术发展规划纲要[EB/OL].http://www.soa.gov.cn/hyjww/xzwgk/gjhyjwj/hykj/webinfo/2008/09/1252915436076518.htm,2009-09-17.
9.国务院.国务院关于印发全国海洋经济发展规划纲要的通知[EB/OL].http://www.gov.cn/zwgk/2005-08/13/content_22246.htm,2005-08-13.
10.何幼林,欧福军,魏华实等.蚁群算法的原理及其在组合优化中的应用[J].黑龙江科技信息,2008,(1):33.
11.胡圣武.地图学[M].北京:北京交通大学出版社,2008.
12.焦健,曾琪明.地图学[M].北京.北京大学出版社,2005.
13.金星姬,贾炜玮.人工神经网络研究概述[J].林业科技情报,2008,40(1):65.
14.金永明.日本《海洋基本计划草案》概要[N].中国海洋报,2008-3-11(3).
15.孔秀英,周晓馥,崔淑芹.达尔文的进化论与作物遗传育种[J].松辽学刊(自然科学版),1994,(1):88-90.
16.李松,李瑞彩,刘兴.基于改进禁忌搜索算法的车辆路径优化[J].铁道运输与经济,2008,30(5):91-94.
17.廖克,简灿良,傅肃性,等.地球信息科学导论[M].北京:科学出版社,2007.
18.廖卫华,张涛.中国完成首次环球大洋科考[EB/OL].http://www.thebeijingnews.com/news/china/2006/0123/013@156875.htm,2006-01-23
19.李建松.地理信息系统原理[M].武汉:武汉大学出版社,2006.
20.李连营,李清泉,李汉武,等.基于MapX的GIS应用开发[M].武汉:武汉大学出版社,2003.
21.李敏强,寇纪淞,林丹,等.遗传算法的基本理论与应用[M].北京:科学出版社,2002.
22.刘勇,康立山,陈毓屏.非数值并行计算方法——遗传算法[M].北京:科学出版社,1998.
23.刘光.地理信息系统二次开发教程——组建篇[M].北京:清华大学出版社,2003.
24.刘宁钟,杨静宇.遗传算法和Hopfield模型求解货郎担问题的比较和分析[J].计算机工程与应用,2003,(4):95-97.
25.刘于江,泽峰.种求解旅行商问题的禁忌搜索算法[J].江西理工大学学报,2006,27(4):38-40.
26.罗云启,曾琨,罗毅.数字化地理信息系统建设与MapInfo高级应用[M].北京:清华大学出版社,2003.
27.马良.旅行推销员问题的算法综述[J].数学的实践与认识,2000,30(2):156-165.
28.马思根,何明勤.应用型GIS的开发模式及其发展趋势[J].计算机与现代化,2009,(5):65-72.
29.莫鸿强.遗传算法搜索能力和编码方式研究[D].[博士学位论文].广州:华南理工大学,2001.
30.宁爱兵,马良.对称型TSP下界的快速估算法[J].系统工程理论与实践,2004,24(12):84-99.
31.彭仪普,刘文熙.Delaunay三角网与Voronoi图在GIS中的应用研究[J].测绘工程,2002,11(3):39-41.
32.齐锐,屈韶林,阳琳赞.用MapX开发地理信息系统[M].北京:清华大学出版社,2003.
33.秦姝,王锦彪.狭义TSP小窗口蚁群算法研究[J].计算机工程与应用,2008,44(12):45-46.
34.任建国.我国海洋科学“十一五”发展战略与优先资助领域[J].中国科学基金,2007,21(1):7-13.
35.宋学春,平凭.我国“大洋一号”科学考察船胜利返航[EB/OL].http://www.people.com.cn/GB/keji/1056/2255299.html,2003-12-19.
36.孙湫词,刘莉莉.我国在东太平洋首次发现海底热液活动区[EB/OL].http://www.zj.xinhuanet.com/newscenter/2008-08/26/content_14229359.htm,2008-08-26.
37.汪存富,蔚承建.一种新的求解ATSP问题的PBIL算法[J].计算机工程与应用,2005,41(27):66-68.
38.王鹏,刘立娜,潘成鹤.GIS中Delaunay三角网的快速建立及拓扑自动生成[J].测绘信息与工程,2001,(4):24-27.
39.王希浩,赵建军.应用型GIS的开发管理与过程设计[J].海军航空工程学院学报,2005,20(2):298-300.
40.王小平,曹立明.遗传算法——理论、应用与软件实现[M].西安:西安交通大学出版社,2002.
41.王志明.船舶航次计划安全评价体系及其软件系统[J].上海海事大学学报,2005,26(1):19-21.
42.武晓波,王世新,肖春生.一种生成Delaunay三角网的合成算法[J].遥感学 报,2000,4(1):32-35.
43.吴信才.地理信息系统原理、方法及应用[M].武汉:中国地质大学出版社,1998.
44.邬伦,刘瑜,张晶,等.地理信息系统——原理、方法和应用[M].北京:科学出版社,2001.
45.肖潇.GIS应用软件开发模式分析[J].计算机与现代化,2007,(9):51-53.
46.邢文训,谢金星.现代优化计算方法[M].北京:清华大学出版社,1999.
47.徐冬梅.“海洋四号”海底探宝船返航 取得4项成果[EB/OL].http://www.people.com.cn/GB/keji/1057/2169395.html,2003-11-04.
48.徐鸿儒.中国海洋学史[M].济南:山东教育出版社,2004.
49.许肖梅.海洋技术概论[M].北京:北京出版社,2000.
50.徐质斌.中国海洋经济发展战略研究[M].广州:广东经济出版社,2007.
51.严晨,王直杰.以TSP为代表的组合优化问题研究现状与展望[J].计算机仿真,2007,24(6):171-174.
52.严蔚敏,吴伟民.数据结构(C语言版)[M].北京:清华大学出版社,1997.
53.杨芙清,梅宏,李克勤.软件复用与软件构件技术[J].电子学报,1999,27(2):68-75.
54.杨金森.海洋强国兴衰史略[M].北京:海洋出版社,2007.
55.杨若黎,顾基发.一种高效的模拟退火全局优化算法[J].系统工程理论与实践,1997,17(5):30-33.
56.尹旭日,张武军.Visual C++环境下MapX的开发技术[M].北京:冶金工业出版社,2009.
57.张炳炎.我国海洋调查船的现状与未来[J].世界科技研究与发展,1998,20(4):36-43.
58.张海荣.地理信息系统原理与应用[M].徐州:中国矿业大学出版社,2008.
59.章孝灿,黄智才,戴企成,等.GIS中基于拓扑结构和凸壳技术的快速TIN生成算法[J].计算机学报,2002,25(11):1212-1218.
60.张晓缋,方浩,戴冠中.遗传算法的编码机制研究[J].信息与控制,1997,26(2):134-139.
61.赵盾,程洁.达尔文进化论的历史考察[J].哈尔滨学院学报,2003,24(3):116-119.
62.赵会丽.应用型GIS的开发[J].河南科技,2006,(4):28-29.
63.周明,孙树栋.遗传算法原理及应用[M].北京:国防工业出版社1999.
64.祝国瑞.地图学[M].武汉:武汉大学出版社,2004.
65.朱晓东,陈晓玲,唐正东.人类生存与发展的新时空:海洋世纪[M].武汉:湖北教育出版社,1999.
66.Aiyer S V B,Niranjan M,Fallside F.A Theoretical Investigation into the Performance of the Hopfield Model[J].IEEE Transactions on Neural Networks,1990,1(2):204-215.
67.Blaser M.A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality[J].ACM Transactions on Algorithms,2008,4(4):47.
68.Colorni A,Dorigo M,Maniezzo V.Distributed Optimization by Ant Colonies[C].Proceedings of ECAL-91——European Conference on Artificial Life.Amsterdam:Elsevier Publishing,1991.134-142.
69. Delaunay B.Sur la sphere vide[J]. Bulletin of the Academy of Science of the USSR, 1934, (6),793-800.
70. Dorigo M.Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale(Optimization, Learning and Natural Algorithms)[D]. [Ph. D. Thesis]. Milano: Politecnico di Milano, 1992.
71. Colorni A,Dorigo M, Maniezzo V. An Investigation of Some Properties of an Ant Algorithm[C]. Proceedings of the Parallel Problem Solving from Nature Conference. Amsterdam:Elsevier Publishing, 1992.509-520.
72. Colorni A, Dorigo M. Maff ioli F, et al. Heuristics from Nature for Hard Combinatorial Optimization Problems[J]. International Transactions in Operational Research, 1996, 3(1): 1-21.
73. Dinabandhu B, Nikhil R P, Sankar K P. Direct Mutation in Genetic Algorithms[J]. Information Sciences,1994, 79(3):251-170.
74. Dorigo M, Gambardella L M. Ant Colony Systenna Cooperative Learning Approach To the Traveling Salesman Problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):53-66.
75. Ejov V, Filar J A, Haythorpe M, et al. Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem[J]. Mathematics of Operations Research, 2009, 34(3):758-768.
76. Garey M R, Johnson D S. Computers and intractability[M]. San Francisco:W. H.Freeman, 1979.
77. Gierman D M, Ryerson R A, Moran G, et al. Remote Sensing and Canada Geographic Information System(CGIS) for Impact Studies[C]. Proceedings of the 3rd Canadian Symposium on Remote Sensing. Ottawa:Canadian Aeronautics and Space Institute, 1975.235-241.
78. Glover F. Future Paths for Integer Programming and Links to Artificial Intelligence[J]. Computers & Operations Research, 1986, 13(5):533 - 549.
79. Goldberg D E. Genetiic Algorithms in Search, Optimization and Machine Learning[M]. MA:Addison-wesley Professional, 1989.
80. Goodchild M F. Geographical Information Science[J]. International Journal of Geographical Information Science, 1992,6(1):31—45.
81. Hung R W, Chang M S, Feng D D, et al.The Hamiltonian Cycle Problem on Circular-Arc Graphs[C]. International Multiconference of Engineers and Computer Scientists. Hong Kong:INT ASSOC ENGINEERS-IAENG, 2009. 630-637.
82. International Maritime Organization. Guidelines for Voyage Planning——Resolution A. 893(21)[EB/OL].http://www. imo. org/includes/blastData. asp/doc_id=10712/893(21). pdf, 1999-11-2 5.
83. Holland J H. Adaptation in Natural and Artificial Systems[M]. Ann Arbor, MI:The University of Michigan Press,1975.
84. Hopfield J J, Tank D W. "Neural" computation of decisions in optimization problems[J]. Biological Cybernetics. 1985, 52(3):141-152.
85. Kirkpatrick S, Gelatt C D,Vecchi M P. Optimization by Simulated Anneal ing[J]. Science, 1983, 220:671-680.
86. Kitano H. Empirical Studies on the Speed of Convergence of the Neural Network Training by Genetic Algorithm[C]. Proceedings of The Eighth National Conference on Artificial Intelligence. Cambridge:MIT Press, 1990. 789-295.
87. Lin S, Kernighan B W. An Effective Heuristic Algorithm for the Traveling-Salesman Problem[J]. Operations Research, 1973,21(2) :498-516.
88. Lingas A. The Greedy and Delaunay Triangulations are not Bad in the Average Case[J]. Information Processing Lectures, 1986, 22(1) :25-31.
89. Liu S B, Ng K M, Ong H L. A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem[C]. Proceedings of World Academy of Science, Engineering and Technology. Canakkale: WORLD ACAD SCI, ENG & TECH-WASET, 2007. 267-271.
90. Maplnfo Corporation. Maplnfo MapX Developer' s Guide[EB/OL]. http://reference. mapinfo. com/common/docs/mapx/MapX_50_DevGuide.pdf, 2002.
91. Metropolis N, Rosenbluth A W, Rosenbluth M N, et al. Equations of State Calculation by Fast Computing Machines[J]. Journal of Chemical Physics,1953, (21) :1087-1092.
92. Miller C, Laflamme R.The DTM-Theory and applications[J]. Photogrammetric Engineering,1958, (24):433-442.
93. Montemanni R, Smith D H, Gambardella L M. A heuristic manipulation technique for the sequential ordering problem[J]. Computers & Operations Research, 2008, 35(12):3931-3944.
94. NOAA. U. S. Ocean Action Plan[EB/OL]. http://ocean. ceq. gov/actionplan. pdf, 2005.
95. NERC. Ocean 2025-Harnessing Marine Research for the Future[EB/OL].http://www. nerc. ac. uk/press/releases/2007/02-oceans2025. asp, 2007-01-10.
96. Pelikan J, Korenar V, Melnicek S. Using Cuts for the Traveling Salesman Problem and the Vehicle Routing Problem[C]. Proceedings of the 22nd International Conference on Mathematical Methods in Economics. Brno:Masarykova University, 2004.248-255.
97. Potvin J Y, Rousseaua JM. Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows[J]. European Journal of Operational Research, 1993, 66(3):331-340.
98. Reeves C R. Mordern Heuristic Techniques for Combinatorial Problems[M]. Oxford:Blackwell Scientific Publications, 1993.
99. Rndolph G. Convergence Analysis of Canonical Genetic Algorithms[J]. IEEE Transactions on Neural Networks,1994, 5(1):96-101.
100. Serra M, Venini P. On Some Applications of Ant Colony Optimization Metaheuristic to Plane Truss optimization[J].Structural and Multidisciplinary Optimization, 2006, 32(6):499-506.
101. Sharon M M, Melody D H, Jerry G. Ocean Survey Planning and Tracking: Integrating Technology to Support Naval Operations[C]. Proceedings of the 20th Annual ESRI International User Conference. Redlands:ESRI Press, 2000.
102. Whitley D, Hanson T. Optimizing Neural Networks Using Faster, More Accurate Genetic Search[C]. Proceedings of the Third International Conference on Genetic Algorithms. San Francisco:Morgan Kaufmann Publishers Incorporated, 1989. 391-396.
103. Whitley D, Starkweather T, Bogart C.Genetic Algorithms and Neural Networks: Optimizing Connections and Connectivity[J]. Parallel Computing, 1990, 14(3):347-361.
104. Wilson G V, Pawley G S. On the Stability of the Traveling Salesman Problem Algorithm of Hopfield and Tank[J]. Biological Cybernetics,1988, 58(1):63-70.
105. Voronoi G. Nouvelles Applications des Parameters Continus, a la Theorie des Formse Quadratiques, Duesieme Memoire:Recherches sur les Paralleloderes Primitifs[J]. Jounal fur die Reine und Angewandte Mathematic, 1908, (134) : 198-287.
106. Yeh C W. Solving Capacitated Vehicle Routing Problem Using DNA-based Computation[C]. Proceedings of 2009 International Conference on Information Management and Engineering. Los Alamitos:IEEE COMPUTER SOC, 2009. 170-174.
107. Yoon B, Holmes D J, Langholz G, et al. Efficient Genetic Algorithms for Training Layered Feed Forward Neural Networks[J]. Information Sciences, 1994, 76(1-2):67-85.