Explore chapters and articles related to this topic
Assessing the quantitative description of the accessibility of buildings in the University of the Philippines Diliman (UPD)
Published in Shin-ya Nishizaki, Masayuki Numao, Jaime Caro, Merlin Teodosia Suarez, Theory and Practice of Computation, 2019
J.M. Choa, P.G. Santiago, A.A. Cariaga, R.P. Feria, L.L. Figueroa, R.C. Solamo
It also contains a path-finding feature for use within one building or between two buildings. As seen in Figure 2, the user must first input four parameters: the origin building and room, and the destination building and room. The application would then return a path from the origin room to an accessible entrance of the origin building, a path from that entrance to the destination room, and a pedestrian route through the streets of the campus. As seen in Figure 3, the latter is a linear path overlaid on the map using GraphHopper Directions API, a reliable and fast web services routing 6, for routing and OSMBonusPack to interact with OSM, while the two former routes are accessed through opening map pointers above the two buildings. These pointers contain user-readable instructions on how to navigate to the destination according to the building selected, as seen in Figure 4.
An efficient algorithm for solving the median problem on real road networks
Published in Engineering Optimization, 2020
Saeed Ghanbartehrani, J. David Porter
A solver tool software was developed based on the open source software GraphHopper to implement the MTD and EGS algorithms. GraphHopper is a web-based route planner software developed in Java whose routing engine comes with the most popular path-finding algorithms, such as A* and Dijkstra's, as well as their bidirectional variants (Karich 2015). GraphHopper is released under the Apache License, which allows developers to ‘use the software for any purpose, distribute, modify, or distribute the modified version of the software without the concern of royalties’ (Apache Software Foundation 2004). A graphical user interface (GUI) was developed for the solver application to simplify the generation of random problems with user-defined parameters, solving the problems and collecting the results for both the MTD and EGS algorithms.