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

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.

References

  1. Bhargava, H. K., Power, D. J. and D. Sun, 2007, Progress in Web-based decision support technologies, Decision Support Systems, 43, pp. 1083-1095. 2007.
  2. Chinnici R., J. Moreau, A. Ryman and S. Weerawarana (Eds.), 2007, Web Services Description Language (WSDL) Version 2.0 Part 1: Core Language, W3C Proposed recommendation, May 23.
  3. Cohen M. D., C. B. Kelly and A. L. Medaglia. 2001, Decision support with web-enables software. Interfaces. 31(2), pp. 109-129.
  4. Dominguez-Ballesteros B., G. Mitra, C. Lucas and N.-S. Koutsoukis, Modelling and solving environments for Mathematical Programming (MP): a status review and new directions, Journal of The Operational Research Society. 53(10). pp. 1072-1092. 2002.
  5. Fielding R.T. and R.N. Taylor. Principled design of the modern web architecture, ACM Trans. Internet Technol. (TOIT), 2(2), pp. 115-150. 2002.
  6. Fu, L., Sun, D. and L. R. Rilett, Heuristic shortest path algorithms for transportation applications: State of the art, Computers & Operations Research 33, pp. 3324- 3343, 2006.
  7. Garroppo, R., Giordano, S., Tavanti, L., 2010. A survey on multi-constrained optimal path computation: Exact and approximate algorithms, Computer Networks, 54, pp. 3081-3107.
  8. Guzolek J, Koch E. Real-time route planning in road network. Proceedings of VINS, September 11-13, 1989. Toronto, Ontario, Canada, p. 165-9.
  9. Gubichev,A. Bedathur, S., Seufert, S. and G. Weikum. 2010. Fast and Accurate Estimation of Shortest Paths in Large Graphs. CIKM'10, October 26-30, Toronto, Ontario, Canada.
  10. Gudgin M., M. Hadley, N. Mendelsohn, J. J. Moreau and H. Nielsen, SOAP version 1.2. Part 1. Messaging framework, http://www.w3.org/TR/soap12-part1/, 2003.
  11. Hart E. P., Nilsson N. J., Raphael B., 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transaction, System Science and Cybernetics; SSC-4(2):100-7.
  12. IBM World Trade Corporation. IBM Mathematical Programming System Extended /370 (MSPX/370): Program Reference No. SH19-1095-1, New York &Paris. Reference No. SH19-1095-1. 1976.
  13. Kuznetsov T. High performance routing for IVHS. IVHS America 3rd Annual Meeting, Washington, DC, April, 1993.
  14. Lindo Systems Inc,. LINGO Modelling System Version 12.0. Manual. Chicago IL, USA: Lindo Systems Inc Lindo Systems Inc. 2008.
  15. Lucas C. and G. Mitra, Computer-assisted MathematicalProgramming (Modelling) System-CAMPS, The Computer Journal, 31(4), pp. 364-375. 1988.
  16. Maximal Software, MPL Modelling System, Release 4.2, 2002.
  17. Nilsson J. N. Problem-solving methods in artificial intelligence. New York: McGraw-Hill; 1971.
  18. Pearl J. Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley Publishing Company; 1984.
  19. UDDI Version 2.04 API Specification, UDDI Committee Specification, 19 July 2002, available on http://uddi.org/pubs/ProgrammersAPI_v2.htm.
  20. Wang H., Huang, J. Z., Qub, Y. and J. Xia. Web services: problems and future directions, Web Semantics: Science, Services and Agents on the World Wide Web. 1 (3). pp. 309-320. 2004.
  21. Kuznetsov T. High performance routing for IVHS. IVHS America 3rd Annual Meeting, Washington, DC, April, 1993.
  22. Willhalm. T., 2005. Engineering Shortest Paths and Layout Algorithms for Large Graphs. Dissertation der Universität Fridericiana zu Karlsruhe (TH).
Download


Paper Citation


in Harvard Style

Lacomme P., Ren L., 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


in Bibtex Style

@conference{icores14,
author={Philippe Lacomme and Libo Ren 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},
}


in EndNote Style

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 - Vincent B.
PY - 2014
SP - 393
EP - 400
DO - 10.5220/0004753403930400