The Second Transportation Student Research Symposium
Abstract Detail
| Name | School | Title of presentation |
| Maaza C Mekuria | NU | Closest Point Problem solving using Geographic modeling |
| Solving closest point problems (CPP) requires the use of various algorithms. Some are suited to a particular purpose than others. Algorithms such as Floyd-Worshall/ Dijkstra, and Network Voronoi diagrams are used to solve CPP. The focus of this research is in determining what is the best approach to solving CPP on a network. Geographic modeling has enabled efficient data manipulations and approximate results could be produced fairly quickly using graphical methods such as Voronoi diagrams. The paper investigates what would be the best way of analyzing a CPP in a geographic setting with an example application in a transportation system. What is the effect if a combination of methods are used (instead of using a single algorithm) for different stages of a problem? Would an approximate but fast solution be sufficient enough to satisfy the needs? What is the gain in accuracy between the various algorithmic solutions? The research employs the use of geographic modeling tools to examine the above questions and test performance of applicable modeling algorithms. |
Events Page
Visit the New England Section of ITE events page for news about other upcoming events around New England, including a Mass ITE Chapter meeting