loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Philippe Lacomme 1 ; Libo Ren 2 ; Nikolay Tchernev 2 and Benjamin Vincent 1

Affiliations: 1 Université Blaise Pascal (LIMOS UMR 6158), France ; 2 Université d’Auvergne (LIMOS UMR 6158), France

ISBN: 978-989-758-017-8

Keyword(s): Shortest Path, Mobile Device, Web Services.

Related Ontology Subjects/Areas/Topics: Applications ; Information Systems ; Mathematical Programming ; Methodologies and Technologies ; Operational Research ; OR in Transportation ; Pattern Recognition ; Software Engineering

Abstract: 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, in recent years there has been a revival of interest in the shortest path problem used in the context of 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 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 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 operational research algorithms and our contribution stands at the crossroads of optimization research community and the web service community expectations. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.226.251.81

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lacomme, P.; Ren, L.; Tchernev, N.; Tchernev, N. and Vincent, B. (2014). Shortest Path Challenging Problem - Context of Mobile Devices in Urban Area Considering Weakened GPS Signal and Data Network Traffic.In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 393-400. DOI: 10.5220/0004753403930400

@conference{icores14,
author={Philippe Lacomme. and Libo Ren. and Nikolay Tchernev. and Nikolay Tchernev. and Benjamin Vincent.},
title={Shortest Path Challenging Problem - Context of Mobile Devices in Urban Area Considering Weakened GPS Signal and Data Network Traffic},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={393-400},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004753403930400},
isbn={978-989-758-017-8},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Shortest Path Challenging Problem - Context of Mobile Devices in Urban Area Considering Weakened GPS Signal and Data Network Traffic
SN - 978-989-758-017-8
AU - Lacomme, P.
AU - Ren, L.
AU - Tchernev, N.
AU - Tchernev, N.
AU - Vincent, B.
PY - 2014
SP - 393
EP - 400
DO - 10.5220/0004753403930400

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.