|
GraphHopper
GraphHopper is an open-source routing library and server written in Java and provides a routing API over HTTP. It runs on the server, desktop, Android, iOS or Raspberry Pi. By default OpenStreetMap data for the road network and elevation data from the Shuttle Radar Topography Mission is used. The front-end is open-source too and called GraphHopper Maps. GraphHopper can be configured to use different algorithms such as Dijkstra, A* and its bidirectional versions. To make routing fast enough for long paths (continental size) and avoid heuristical approaches GraphHopper uses contraction hierarchies by default. In the Java Magazine from Oracle, the author, Peter Karich, describes the techniques necessary to make the system memory efficient and fast. Furthermore, GraphHopper is built on a large test suite including unit, integration and load tests. The Apache License allows everyone to customize and integrate GraphHopper in free or commercial products, and together with the query ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
GraphHopper Community
GraphHopper is an open-source Open source is source code that is made freely available for possible modification and redistribution. Products include permission to use and view the source code, design documents, or content of the product. The open source model is a decentrali ... routing library and server written in Java (programming language), Java and provides a routing API over HTTP. It runs on the server, desktop, Android (operating system), Android, iOS or Raspberry Pi. By default OpenStreetMap data for the road network and elevation data from the Shuttle Radar Topography Mission is used. The front-end is open-source too and called GraphHopper Maps. GraphHopper can be configured to use different algorithms such as Dijkstra's algorithm, Dijkstra, A* search algorithm, A* and its Bidirectional search, bidirectional versions. To make routing fast enough for long paths (continental size) and avoid heuristical approaches GraphHopper uses contraction hierarchies by default. In th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Map Matching
Map matching is the problem of how to match recorded geographic coordinates to a logical model of the real world, typically using some form of Geographic Information System. The most common approach is to take recorded, serial location points (e.g. from GPS) and relate them to edges in an existing street graph (network), usually in a sorted list representing the travel of a user or vehicle. Matching observations to a logical model in this way has applications in satellites navigation, GPS tracking of freight, and transportation engineering. Map matching algorithms can be divided in real-time and offline algorithms. Real-time algorithms associate the position during the recording process to the road network. Offline algorithms are used after the data is recorded and are then matched to the road network. Real-time applications can only calculate based upon the points prior to a given time (as opposed to those of a whole journey), but are intended to be used in 'live' environments. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Comparison Of Web Map Services
__TOC__ See also * List of online map services * GraphHopper * Navteq * Petal Maps * Online virtual globes * Tencent Maps * Traffic Message Channel (TMC) References {{Reflist External links Google MapsBing MapsMapQuest MapsMapy.comOpenStreetMapHereApple MapsYandex.Maps Web mapping Web mapping or an online mapping is the process of using, creating, and distributing maps on the World Wide Web (the Web), usually through the use of Web GIS, Web geographic information systems (Web GIS). A web map or an online map is both served ... Street view services Transportation geography Web mapping ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
OpenStreetMap
OpenStreetMap (abbreviated OSM) is a free, Open Database License, open geographic database, map database updated and maintained by a community of volunteers via open collaboration. Contributors collect data from surveying, surveys, trace from Aerial photography, aerial photo imagery or satellite imagery, and import from other freely licensed geodata sources. OpenStreetMap is Free content, freely licensed under the Open Database License and is commonly used to make electronic maps, inform turn-by-turn navigation, and assist in humanitarian aid and Data and information visualization, data visualisation. OpenStreetMap uses its own data model to store geographical features which can then be exported into other GIS file formats. The OpenStreetMap website itself is an Web mapping, online map, geodata search engine, and editor. OpenStreetMap was created by Steve Coast in response to the Ordnance Survey, the United Kingdom's national mapping agency, failing to release its data to the pub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Isochrone Map
An isochrone map in geography and urban planning is a map that depicts the area accessible from a point within a certain time threshold. An wikt:isochrone, isochrone (iso = equal, chrone = time) is defined as "a line drawn on a map connecting points at which something occurs or arrives at the same time". In hydrology and transportation planning isochrone maps are commonly used to depict areas of equal travel time. The term is also used in cardiology as a tool to visually detect abnormalities using body surface distribution. History Early examples of Isochrone maps include the Francis Galton, Galton's ''Isochronic Postal Charts'' and ''Isochronic Passage Charts'' of 1881 and 1882, Collins Bartholomew, Bartholomew's ''Isochronic Distance Map and Chart'' first published 1889, and Albrecht Penck, Albrecht Penck's ''Isochronenkarte'' first published 1887. Where as Galton and the Bartholomews published maps depicting the days or weeks it took to travel long distances, Albrecht furthe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Contraction Hierarchies
In computer science, the method of contraction hierarchies is a speed-up technique for finding the shortest path in a graph. The most intuitive applications are car-navigation systems: a user wants to drive from A to B using the quickest possible route. The metric optimized here is the travel time. Intersections are represented by vertices, the road sections connecting them by edges. The edge weights represent the time it takes to drive along this segment of the road. A path from A to B is a sequence of edges (road sections); the shortest path is the one with the minimal sum of edge weights among all possible paths. The shortest path in a graph can be computed using Dijkstra's algorithm but, given that road networks consist of tens of millions of vertices, this is impractical. Contraction hierarchies is a speed-up method optimized to exploit properties of graphs representing road networks. The speed-up is achieved by creating shortcuts in a preprocessing phase which are then used ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Apache License
The Apache License is a permissive free software license written by the Apache Software Foundation (ASF). It allows users to use the software for any purpose, to distribute it, to modify it, and to distribute modified versions of the software under the terms of the license, without concern for royalties. The ASF and its projects release their software products under the Apache License. The license is also used by many non-ASF projects. History Beginning in 1995, the Apache Group (later the Apache Software Foundation) released successive versions of the Apache HTTP Server. Its initial license was essentially the same as the original 4-clause BSD license, with only the names of the organizations changed, and with an additional clause forbidding derivative works from bearing the Apache name. In July 1999, the Berkeley Software Distribution accepted the argument put to it by the Free Software Foundation and retired their ''advertising clause'' (clause 3) to form the new 3-clau ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Vehicle Routing Problem
The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers?" It generalises the travelling salesman problem (TSP). It first appeared in a paper by George Dantzig and John Ramser in 1959, in which the first algorithmic approach was written and was applied to petrol deliveries. Often, the context is that of delivering goods located at a central depot to customers who have placed orders for such goods. The objective of the VRP is to minimize the total route cost. In 1964, Clarke and Wright improved on Dantzig and Ramser's approach using an effective greedy algorithm called the savings algorithm. Determining the optimal solution to VRP is NP-hard, so the size of problems that can be optimally solved using mathematical programming or combinatorial optimization can be limited. Therefore, commercial solvers tend to use H ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
The GNOME Project
GNOME Project is a community behind the GNOME desktop environment and the software platform upon which it is based. It consists of all the software developers, artists, writers, translators, other contributors, and active users of GNOME. The GNOME Foundation used to recognize GNOME as part of GNU; however, in 2021, the staff of the Foundation declared that GNOME is not a GNU Project. GNOME Foundation In August 2000, the GNOME Foundation was set up to deal with administrative tasks and press interest, and to act as a contact point for companies interested in developing GNOME software. While not directly involved in technical decisions, the Foundation does coordinate releases and decide which projects will be part of GNOME. Membership is open to anyone who has made a non-trivial contribution to the project. Members of the Foundation elect a board of directors every November, and candidates for the positions must be members themselves. Programs and events The GNOME Project holds ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Komoot
Komoot is a mobile app for navigation and route planning. History Komoot was founded in 2010 and is based in Germany. The app was launched in 2013. Partnerships Komoot partners with various sporting events including Transcontinental Race and Silk Road Race. It also sponsors various athletes, for example Lael Wilcox and Jonas Deichmann. Komoot has been acquired by Bending Spoons in March 2025. Roughly 85% of the staff being let go within the first two weeks. Features The app has both free and paid-for features. It can create routes for various activities including walking, running, cycling, and mountain biking. It can report what percentage of a route consists of a given surface (roads, cycle tracks, gravel).{{Cite web, last=Nehr, first=Zach, date=2021-11-22, title=Komoot vs Strava: Which cycling app is best?, url=https://www.bikeperfect.com/features/komoot-vs-strava-which-cycling-app-is-best, access-date=2022-02-01, website=Bike Perfect, language=en Technology The a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Deutsche Bahn
(, ; abbreviated as DB or DB AG ) is the national railway company of Germany, and a state-owned enterprise under the control of the German government. Headquartered in the Bahntower in Berlin, it is a joint-stock company ( AG). DB was founded after the merger between Deutsche Bundesbahn and the East German Deutsche Reichsbahn in 1994 after the unification of Germany and has been operating ever since. is the second-largest transport company in Germany, after the German postal and logistics company / DHL. DB provides both long-distance and regional transport, serving around 132 million long distance passengers and 1.6 billion regional passengers in 2022. In 2022, DB transported 222 million tons of cargo. Company profile The group is divided into several companies, including '' DB Fernverkehr'' (long-distance passenger), '' DB Regio'' (local passenger services) and '' DB Cargo'' (rail freight). The Group subsidiary '' DB InfraGO'' also operates large parts of the German ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Rome2rio
Rome2Rio is an Australian online multimodal transport journey planner offering travel services globally. The company is based in Melbourne, Australia, and is owned by the German online travel comparison and booking website Omio. History Rome2Rio was founded by Bernhard Tschirren and Michael Cameron, former Microsoft software engineers, who began working on the project in September 2010. The beta version of Rome2Rio was launched on 7 April 2011. In May 2012, Rod Cuthbert, founder of Viator, became CEO, and the company raised $450,000 in funding. Rome2Rio has received several awards, including the People's Choice Award at Phocuswright 2012, the TRAVELtech Global Collect Website of the Year in 2013, the Data Specialist Award at the WITovation Awards in 2015, and the Best Metasearch Award at the Travolution Awards in 2016. The company raised a total of $2.8 million in funding, including a $1.2 million grant from Commercialization Australia in 2014. In July 2015, Rome2Rio announced ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
