目 录
1 引言...................................................................................................................................1
1.1 研究的背景及意义..............................................................................................1
1.2 国外研究发展现状..............................................................................................1
1.3 国内研究发展现状..............................................................................................2
1.4 课题研究内容......................................................................................................2
2 基于遗传算法的旅游路程和资金需求最优规划方案的设计.......................................3
2.1 遗传算法的介绍....................................................................................................3
2.2 最优规划方案的代码实现思路............................................................................4
2.3 最优规划方案的两地之间距离计算....................................................................6
3 旅游路程和资金需求最优规划方案的实现...................................................................7
3.1 资料搜集和实验准备................................................................................................7
3.2 代码编写步骤............................................................................................................9
4 旅游路程和资金需求最优规划方案的测试结果.........................................................14
4.1 代码运行结果..........................................................................................................14
4.2 运行结果分析..........................................................................................................16
4.3 对比实验结果分析.................................................................................................16
结 论...................................................................................................................................18
致 谢...................................................................................................................................19
参 考 文 献.........................................................................................................................20