Shortest Path Challenging Problem - Context of Mobile Devices in Urban Area Considering Weakened GPS Signal and Data Network Traffic
Philippe Lacomme, Libo Ren, Nikolay Tchernev, Benjamin Vincent · 2014
The shortest path problem is a well know routing problem which received a considerable amount of attention for several decades. This problem is the cornerstone of any real-world routing problem including the VRP or the Hub Location. The majority of efficient methods dedicated to these problems consist in computing first the matric of shortest path between nodes. Furthermore, there has been a renaissance of interest in the shortest path problem in recent year for use in various transportation engineering applications. This paper relates to the conception of efficient routing algorithms tuned for mobility. More precisely, it is targeted to the field of pedestrian mobility in an urban environment. In a mobile environment, specific constraints as the treatment of wireless network traffic disturbances must be taken into account. The architecture that we tune for the project is based on an active monitoring system, which dynamically required new shortest path calculation using the exposed web service API. The web service is performed when a specific constraint appears or a new part of the path is required. Using of such architecture offers a new approach in spreading operational research algorithms and our contribution stands at the crossroads of optimization research community and the web service community expectations.