文件列表:

Desktop Application (0, 2020-06-26)
Desktop Application\Centralized_Dijkstra (0, 2020-06-26)
Desktop Application\Centralized_Dijkstra\.classpath (424, 2020-06-26)
Desktop Application\Centralized_Dijkstra\.project (379, 2020-06-26)
Desktop Application\Centralized_Dijkstra\.settings (0, 2020-06-26)
Desktop Application\Centralized_Dijkstra\.settings\org.eclipse.jdt.core.prefs (587, 2020-06-26)
Desktop Application\Centralized_Dijkstra\Connections.txt (314, 2020-06-26)
Desktop Application\Centralized_Dijkstra\Coordinates.txt (211, 2020-06-26)
Desktop Application\Centralized_Dijkstra\JAR (0, 2020-06-26)
Desktop Application\Centralized_Dijkstra\JAR\commons-logging-1.1.1.jar (60686, 2020-06-26)
Desktop Application\Centralized_Dijkstra\JAR\jxmapviewer2-2.4.jar (110022, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src (0, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\DijkstraShortestPath.java (1302, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\Edge.java (874, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\Main.java (1194, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\Node.java (1666, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\drawGraph.java (6897, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\drawPanels.java (20958, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\importData.java (3803, 2020-06-26)
Desktop Application\Centralized_Dijkstra\src\transparentBackground.java (842, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford (0, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\.classpath (506, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\.project (383, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\.settings (0, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\.settings\org.eclipse.jdt.core.prefs (587, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\Connections.txt (314, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\Coordinates.txt (211, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\JAR (0, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\JAR\commons-logging-1.1.1.jar (60686, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\JAR\jxmapviewer2-2.4.jar (110022, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\src (0, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\src\Edge.java (874, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\src\Main.java (1161, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\src\Node.java (2034, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\src\distributedBellManFord.java (1743, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\src\drawGraph.java (6669, 2020-06-26)
Desktop Application\Distributed_Bellman-Ford\src\drawPanels.java (20718, 2020-06-26)
... ...

# Shortest Route Problem This is a solution to the shortest route problem, using network routing algorithms in transport networks. ## Contents 1. [Description](https://github.com/cdaou/shortest_route/blob/master/#Description ) 2. [DesktopApplication](https://github.com/cdaou/shortest_route/blob/master/#DesktopApplication ) 3. [WebApplication](https://github.com/cdaou/shortest_route/blob/master/#WebApplication ) 4. [Dependencies](https://github.com/cdaou/shortest_route/blob/master/#Dependencies ) 5. [License](https://github.com/cdaou/shortest_route/blob/master/#License ) ## Description With the development of technology and the evolution of societies, more and more people are using a passenger car, which, combined with the urbanization of the modern times, results in traffic congestion and long delay in passenger movement, especially in large urban centers. Thus, in the context of Intelligent Transport Systems (ITS) and aiming at traffic decongestion, in this project a Java and JavaScript application has been developed, that implement network routing algorithms in transport networks to find the shortest route. More specifically, the communication technologies used in ITS, network routing algorithms and protocols were studied and the (centralized) Dijkstra and (distributed) Bellman-Ford algorithms were used to develop the application. The algorithms are applied to a graph representing a part of the road network, that is roads are considered as the links and lanterns as the nodes of the graph and the weight of the links indicates the traffic factor that has a road at that moment. The user can select the initial node in which is located, and the system calculates and displays the shortest path to certain specific destinations (e.g. airport, bus station, central points, etc.) defined by the administrator. Βoth projects were implemented for the area of the center of Thessaloniki. ## DesktopApplication This implementation is more useful to the system administrator. In this case the map is static and shows a specific area, which has been pre-selected by the program. Τhe nodes are inserted by the administrator in the connection and coordinate files. The advantage of this application is that the administrator can very easily edit the graph and perform tests. ### How to run * To run Bellman-Ford you will need JavaFX. You can find it [here](https://github.com/cdaou/shortest_route/blob/master/https://gluonhq.com/products/javafx/ "JavaFX"). For Eclipse IDE you can just `Go to Help > Go to Eclipse MarketPlace > Search e(fx)clipse > Install it`. Then, to add it on the project just follow: `Java Build Path > Libraries > Add Libraries > JavaFx SDK` * Download a project and import as an existing project into your IDE. * Run Main class. ### User Interface  * In the top panel user can import data. * In the main panel user can see and edit nodes and connections by right-clicking on each node. Nodes with orange color are the destination-nodes to which shortest path will be calculated. * In the bottom-left panel user can choose what information wants to see in the main panel. * In the bottom-middle panel the shortest path will appear when calculated. * In the bottom-right panel coordinates of mouse pointer appear. ## WebApplication This implementation is more useful to the user. In this case the map is dynamic, which means that the user can drag it (and/or zoom) to any area. The pins which represent the nodes have been manually added by the user (only for the area of Thessaloniki) to the data.js file, where the coordinates of the traffic lights and the connections are stored in JSON form. The advantage of this application is that is very user-friendly and is essentially the end product, which will be used by the user. ### How to run * Download a project and import as an existing project into your IDE. * Run Launch class. * Visit http://localhost:8080/index.jsp from a browser. ### User Interface  * In the top panel user can choose the initial node and the destination-nodes to which shortest paths will be calculated and shown on the map. * The map is draggable and zoomable. User can click on each pin to see its info. * The user's location can be shown, too. * In the bottom of the map, the runtime is calculated and shown. * If there will be a change in a path, then user gets an alert and the new shortest path(s) is shown up. ## Dependencies * JavaFX - https://openjfx.io/ * Apache Commons Logging - http://commons.apache.org/proper/commons-logging/download_logging.cgi * jxmapviewer2 - https://github.com/msteiger/jxmapviewer2 * GSON - https://github.com/google/gson * Apache Tomcat - http://tomcat.apache.org/ * Leaflet - https://leafletjs.com/ * Mapbox - https://www.mapbox.com/ ## License Copyright 2019 Christos Daoulas Licensed under the Apache License, Version 2.0 (the "License"); Υou may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：