紧急车辆调度系统DAA 2018年Spring-源码
紧急车辆调度系统（DAA Spring 2018）
项目目标
设计紧急车辆调度系统（考虑到三种不同类型的紧急车辆是第一辆，第一辆是消防车，消防车是第二辆，警车是第三辆），并实现一种算法，该算法依次处理一个请求以找到最接近的请求可用的紧急车辆
使用的语言-JAVA
介绍
为了设计紧急车辆调度系统，我们最初开始在单独的文本文件中收集和建立车辆位置，车辆请求数据。 为了利用上述考虑的数据，我们生成了一些算法，包括Dijkstra的车辆请求算法，搜索车辆和调度车辆算法。 因此，使用Dijkstra的算法可以找到所需的邮政编码和可用的邮政编码之间的最短路径，并将输出提取到文件中。
使用的算法
Dijkstra的算法–该算法的目的是找到图中节点之间的最短路径。 例如，如果图形的节点表示邮政编码，并且边路径成本表示通过一条直路连接的成对邮政编码之间的行驶距离，则Dijkstra的算法可用于查找一个邮政编
文件下载
资源详情
[{"title":"（ 57 个子文件 440KB ） 紧急车辆调度系统DAA 2018年Spring-源码","children":[{"title":"Emergency-Vehicle-Dispatch-System-DAA-Spring-2018-main","children":[{"title":"Documention","children":[{"title":"DAA PROJECT REPORT.pdf <span style='color:#111;'> 334.42KB </span>","children":null,"spread":false},{"title":"Emergency vehicle dispatch graph.JPG <span style='color:#111;'> 72.27KB </span>","children":null,"spread":false}],"spread":true},{"title":"EmergencyVehicleDispatchSystem","children":[{"title":"EmergencyVehicleRequest.txt <span style='color:#111;'> 251B </span>","children":null,"spread":false},{"title":".project <span style='color:#111;'> 389B </span>","children":null,"spread":false},{"title":"src","children":[{"title":"DijkstraAlgorithm1.java <span style='color:#111;'> 7.35KB </span>","children":null,"spread":false},{"title":"VehicleDispatch.java <span style='color:#111;'> 3.12KB </span>","children":null,"spread":false},{"title":"VehicleDispatch1.java <span style='color:#111;'> 3.12KB </span>","children":null,"spread":false},{"title":"com","children":[{"title":"knowledge","children":[{"title":"daaproject","children":[{"title":"VehicleDispatch.java <span style='color:#111;'> 3.15KB </span>","children":null,"spread":false},{"title":"InputFileReader.java <span style='color:#111;'> 788B </span>","children":null,"spread":false},{"title":"Main.java <span style='color:#111;'> 1.26KB </span>","children":null,"spread":false},{"title":"DijkstraAlgorithm.java <span style='color:#111;'> 7.29KB </span>","children":null,"spread":false},{"title":"OutputFile.java <span style='color:#111;'> 1.26KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true},{"title":"InputFileReader.java <span style='color:#111;'> 802B </span>","children":null,"spread":false},{"title":"Main1.java <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"OutputFile1.java <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"Main.java <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"DijkstraAlgorithm.java <span style='color:#111;'> 7.35KB </span>","children":null,"spread":false},{"title":"InputFileReader1.java <span style='color:#111;'> 802B </span>","children":null,"spread":false},{"title":"OutputFile.java <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false}],"spread":false},{"title":"code","children":[{"title":"DijkstraAlgorithm1.java <span style='color:#111;'> 7.35KB </span>","children":null,"spread":false},{"title":"VehicleDispatch1.java <span style='color:#111;'> 3.12KB </span>","children":null,"spread":false},{"title":"Main1.java <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"OutputFile1.java <span style='color:#111;'> 1.23KB </span>","children":null,"spread":false},{"title":"InputFileReader1.java <span style='color:#111;'> 802B </span>","children":null,"spread":false}],"spread":true},{"title":"Results.txt <span style='color:#111;'> 641B </span>","children":null,"spread":false},{"title":".idea","children":[{"title":"misc.xml <span style='color:#111;'> 262B </span>","children":null,"spread":false},{"title":"workspace.xml <span style='color:#111;'> 30.20KB </span>","children":null,"spread":false},{"title":"modules.xml <span style='color:#111;'> 300B </span>","children":null,"spread":false}],"spread":true},{"title":".settings","children":[{"title":"org.eclipse.jdt.core.prefs <span style='color:#111;'> 581B </span>","children":null,"spread":false}],"spread":true},{"title":"EmergencyVehicleDispatchSystem.iml <span style='color:#111;'> 437B </span>","children":null,"spread":false},{"title":"classfiles","children":[{"title":"OutputFile.class <span style='color:#111;'> 2.18KB </span>","children":null,"spread":false},{"title":"VehicleDispatch.class <span style='color:#111;'> 5.57KB </span>","children":null,"spread":false},{"title":"Main.class <span style='color:#111;'> 3.52KB </span>","children":null,"spread":false},{"title":"Graph$Vertex.class <span style='color:#111;'> 1.98KB </span>","children":null,"spread":false},{"title":"InputFileReader.class <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"Graph.class <span style='color:#111;'> 3.65KB </span>","children":null,"spread":false},{"title":"DijkstraAlgorithm.class <span style='color:#111;'> 2.60KB </span>","children":null,"spread":false},{"title":"Graph$Edge.class <span style='color:#111;'> 511B </span>","children":null,"spread":false}],"spread":true},{"title":".classpath <span style='color:#111;'> 293B </span>","children":null,"spread":false},{"title":"bin","children":[{"title":"OutputFile.class <span style='color:#111;'> 2.18KB </span>","children":null,"spread":false},{"title":"VehicleDispatch.class <span style='color:#111;'> 5.57KB </span>","children":null,"spread":false},{"title":"Main.class <span style='color:#111;'> 3.52KB </span>","children":null,"spread":false},{"title":"Graph$Vertex.class <span style='color:#111;'> 1.98KB </span>","children":null,"spread":false},{"title":"com","children":[{"title":"knowledge","children":[{"title":"daaproject","children":[{"title":"OutputFile.class <span style='color:#111;'> 2.24KB </span>","children":null,"spread":false},{"title":"VehicleDispatch.class <span style='color:#111;'> 5.58KB </span>","children":null,"spread":false},{"title":"Main.class <span style='color:#111;'> 3.53KB </span>","children":null,"spread":false},{"title":"Graph$Vertex.class <span style='color:#111;'> 2.11KB </span>","children":null,"spread":false},{"title":"InputFileReader.class <span style='color:#111;'> 1.36KB </span>","children":null,"spread":false},{"title":"Graph.class <span style='color:#111;'> 4.01KB </span>","children":null,"spread":false},{"title":"DijkstraAlgorithm.class <span style='color:#111;'> 2.87KB </span>","children":null,"spread":false},{"title":"Graph$Edge.class <span style='color:#111;'> 586B </span>","children":null,"spread":false}],"spread":false}],"spread":false}],"spread":false},{"title":"InputFileReader.class <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"Graph.class <span style='color:#111;'> 3.65KB </span>","children":null,"spread":false},{"title":"DijkstraAlgorithm.class <span style='color:#111;'> 2.60KB </span>","children":null,"spread":false},{"title":"Graph$Edge.class <span style='color:#111;'> 511B </span>","children":null,"spread":false}],"spread":true},{"title":"AvailableVehicles.txt <span style='color:#111;'> 343B </span>","children":null,"spread":false}],"spread":false},{"title":"README.md <span style='color:#111;'> 2.31KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]
评论信息
其他资源
- 脉冲神经网络的一个训练方法
- TIMIT语音数据库
- [中文和英文版]线性代数应该这样学
- 用java进行WPS的二次开发包
- LMSE(Ho-Kashyap).rar
- 下载地理探测器 Geodetector下载 软件及教程下载
- 烟雾报警器完整版proteus可仿真
- STM32与FPGA进行16位SPI通信
- 基于海思HI3518EV200的LiteOs开发包资料，分享下SDK
- LabView2018 下载安装教程
- 博途（TIA）内部培训资料
- GoWeb编程pdf绝对可下载
- 金蝶云k3cloud初始化上线七个步骤 第一步 安装部署实施篇
- 吉赫半导体激光器的性能优于普通固体激光器
- PDF转PPT工具.rar
- C++编写的后方交会程序
- leetcode-常见考题1.pdf
- VS2012C#开发ActiveX控件、生成MSI与制作CAB文件
- 分布式消息系统Kafka.pdf
- 良精通用企业网站管理系统
- MSTLAB仿真
- opencv3.4.3 mingw32编译
- 非线性分析答案
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明