![](bg8.png)
The first experimentation reported in this paper
pushes us into considering that complexity and proof
of optimality are not the only key of efficient
algorithms in the context of mobility but persuade us
that a valuable quality of service strongly depends of
a correct integration of components into a global
system.
Also, the following developments are suggested
for the future research; Besides Dijkstra’s algorithm,
other algorithms can also be applied in the dynamic
approach to improve the computational aspects of
the proposed algorithm.
REFERENCES
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.
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.
Cohen M. D., C. B. Kelly and A. L. Medaglia. 2001,
Decision support with web-enables software.
Interfaces. 31(2), pp. 109-129.
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.
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.
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.
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.
Guzolek J, Koch E. Real-time route planning in road
network. Proceedings of VINS, September 11–13,
1989. Toronto, Ontario, Canada, p. 165–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.
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.
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.
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.
Kuznetsov T. High performance routing for IVHS. IVHS
America 3rd Annual Meeting, Washington, DC, April,
1993.
Lindo Systems Inc,. LINGO Modelling System Version
12.0. Manual. Chicago IL, USA: Lindo Systems Inc
Lindo Systems Inc. 2008.
Lucas C. and G. Mitra, Computer-assisted Mathematical-
Programming (Modelling) System—CAMPS, The
Computer Journal, 31(4), pp. 364-375. 1988.
Maximal Software, MPL Modelling System, Release 4.2,
2002.
Nilsson J. N. Problem-solving methods in artificial
intelligence. New York: McGraw-Hill; 1971.
Pearl J. Heuristics: intelligent search strategies for
computer problem solving. Addison-Wesley
Publishing Company; 1984.
UDDI Version 2.04 API Specification, UDDI Committee
Specification, 19 July 2002, available on
http://uddi.org/pubs/ProgrammersAPI_v2.htm.
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.
Kuznetsov T. High performance routing for IVHS. IVHS
America 3rd Annual Meeting, Washington, DC, April,
1993.
Willhalm. T., 2005. Engineering Shortest Paths and
Layout Algorithms for Large Graphs. Dissertation der
Universität Fridericiana zu Karlsruhe (TH).
ICORES2014-InternationalConferenceonOperationsResearchandEnterpriseSystems
400