Разработка и исследование информационно-справочной системы поиска оптимальных путей проезда на пассажирском транспорте

Список литературы

1. Rodriguez P., Spanner С., Biersack E.W. Analysis of Web Caching Architectures: Hierarchical and Distributed Caching / IEEE/ACM Transactions on Networking’Ol (TON), August 2001, 684. Springer.
2. M’uller-Hannemann M., Schulz F., Wagner D., Zaroliagis C. Timetable Information: Models and Algorithms in Algorithmic Methods for Railway Optimization, Springer Berlin / Heidelberg, 2007
3. Brodal G. S., Jacob R. Time-dependent networks as models to achieve fast exacttime-table queries. Technical Report ALCOMFT-TR-Ol-176, BRICS, University of Aarhus, 1. Denmark, 2001.
4. Cooke K. L., Halsey E. The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications, 14:493¹⁹⁸, 1966.
5. DELFI. Durchg’angige elektronische Fahrplaninformation. http://www.delfi.de/.
6. Dijkstra E. W. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269−271, 1959.
7. EFA. A timetable information system by Mentz Datenverarbeitung GmbH, M’unchen, Germany, http://www.mentzdv.de/.
8. Ehrgott M. Multicriteria Optimization. Springer, 2000.
9. Ehrgott M., Gandibleux X. Multiobjective combinatorial optimization. In Multiple Criteria Optimization — State of the Art Annotated Bibliographic Surveys, p. 369- 444. Kluwer Academic Publishers, Boston, MA., 2002.
10. EUSpirit. European travel information system, http://www.eu-spirit.com/.
11. Gabriel S., Bernstein D. The traffic equilibrium problem with non additive path costs. Transportation Science, 31(4):337−348, 1997.
12. HAFAS. A timetable information system by HaCon Ingenieurgesellschafit mbH, Hannover, Germany, http://www.hacon.de/hafas/.
13. Hansen P. Bicriteria path problems. In G. Fandel and T. Gal, editors, Multiple Criteria Decision Making Theory and Applications, volume 177 of Lecture Notes in Economics and Mathematical Systems, pages 109−127. Springer Verlag, Berlin, 1979.
14. Hensen D., Truong T. Valuation of travel times savings. Journal of Transport Economics and Policy, p. 237−260, 1985.
15. Kostreva M. M., Wiecek M. M. Time dependency in multiple objective dynamic programming. Journal of Mathematical Analysis and Applications, 173:289−307, 1993.
16. London P. e-solutions in vector minimization problems. Journal of Optimization Theory and Applications, 43:265−276, 1984.
17. Martins E. Q. V. On a multicriteria shortest path problem. European Journal of Operations Research, 16:236−245, 1984.
18. M’ohring R. Verteilte Verbindungssuche im «offentlichen Personenverkehr: Graphentheoretische Modelle und Algorithmen. In Angewandte Mathematik insbesondere Informatik, p. 192−220. Vieweg, 1999.
19. M’uller-Hannemann M., Schnee M. Finding all attractive train connections by multicriteria Парето search. In Proceedings of the 4th Workshop in Algorithmic Methods and Models for Optimization of Railways (ATMOS 2004).
20. M"uller-Hannemann M., K. Weihe Pareto shortest paths is often feasible in practice. In Algorithm Engineering WAE 2001, volume 2141 of LNCS, pages 185−198. Springer, 2001.
21. Nachtigal K. Time depending shortest-path problems with applications to railway networks. European Journal of Operations Research, 83:154−166, 1995.
22. Orda A., Rom R. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM, 37(3), 1990.
23. Orda A., Rom R. Minimum weight paths in time-dependent networks. Networks, 21, 1991.
24. Pallottino S., ScutelKa M. G. Shortest path algorithms in transportation models: Classical and innovative aspects. In Equilibrium and Advanced Transportation Modelling, chapter 11. Kluwer Academic Publishers, 1998.
25. Papadimitriou C., Yannakakis M. On the approximability of trade-offs and optimal access of web sources. In Proc. 41st IEEE Symp. on Foundations of Computer Science FOCS 2000, p. 86−92. 2000.
26. Pyrga E., Schulz F., Wagner D., Zaroliagis C. Experimental comparison of shortest path approaches for timetable information. In Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments, p. 88−99. SIAM, 2004.
27. Rote G. Path problems in graphs. In G. Tinhofer, E. Mayr, H. Noltemeier, and M. Syslo, editors, Computational Graph Theory, pages 155−190. Springer, 1990.
28. Schulz F. Timetable Information and Shortest Paths. PhD thesis, Universit 'at Karlsruhe (TH), Fakult’at Informatik, 2005.
29. Schulz F., Wagner D., Weihe K. Dijkstra’s algorithm on-line: An empirical case study from public railroad transport. Journal of Experimental Algorithmics, 5(12), 2000.
30. Schulz F., Wagner D., Zaroliagis C. Using multi-level graphs for timetable information in railway systems. In Proceedings 4th Workshop on Algorithm Engineering and Experiments (ALENEX), volume 2409 of LNCS, p. 43−59. Springer, 2002.
31. Theune D. Robuste und effiziente Methoden zur L’osung von Wegproblemen. Teubner Verlag, Stuttgart, 1995.
32. Tsaggouris G., Zaroliagis C. Improved FPTAS for multiobjective shortest paths with applications. Technical Report CTI TR 2005/07/03, Computer Technology Institute. And DELIS-TR-0238 (DELIS project), July 2005.
33. Tulp E., Sikl’ossy L. TRAINS, an active time-table searcher. In Eighth European Conf. on AI, p. 170−175, 1988.
34. Vassilvitskii S., Yannakakis M. Efficiently computing succinct trade-off curves. In Automata, Languages, and Programming ICALP 2004, volume 3142 of Lecture Notes in Computer Science, p. 1201−1213. Springer, 2004.
35. Wagner D., Willhalm T. Speed-up techniques for shortest path computations. In Algorithmic Methods for Railway Optimization, LNCS. Springer.
36. Wagner D., Willhalm T. Geometric speed-up techniques for finding shortest paths in large sparse graphs. In Proceedings of the 11th European Symposium on Algorithms (ESA 2003), volume 2832 of LNCS, p. 776−787. Springer, 2003.
37. Warburton A. Approximation of Pareto optima in multiple-objective shortest path problems. Operations Research, 35:70−79, 1987.
38. White D. J. Epsilon efficiency. Jorunal of Optimization Theory and Applications, 49:319−337, 1986.
39. Технический проект на комплект терминального оборудования «Экспресс-3» —¦ М.: НИИМПС, 1997. — 170 стр.
40. Протокол BSC-3. Описание. — М.: НИИМПС, 1997. — 35 стр.
41. Олифер В. Г., Олифер Н. А. Компьютерные сети. Принципы, технологии, протоколы — СПб.: Питер, 2002. — 672с.
42. Кормен Т., Лейзерсон Ч., Ривест Р. Алгоритмы построение и анализ. — Москва.: МЦНМО: БИНОМ, 2004. — 960 с.
43. Вишневский В. М. Теоретические основы проектирования компьютерных сетей. М.: Техносфера, 2003. — 512 с.
44. Кристофидес Н. Теория графов. Алгоритмический подход.—М.: Мир, 1978. 321 с.
45. Технический проект. Подсистема информационного обмена АСУ «Сирена-2». Документ 8, т. 1.— ИПУ, 1983.
46. Международная система бронирования авиабилетов www.amadeus.com
47. Европейская справочная система, http://www.bahn.de
48. МЖА, портал доступа к системе «ЭКСПРЕСС», http://www.mza.ru
49. Сайт «Российские железные дороги», http://www.rzd.ru
50. Сайт Тверского автовокзала, http://www.tverbus.tvcom.ru
51. АСУ автобусного сообщения в Украине, http://www.bus.com.ua
52. Stout В. Алгоритмы поиска пути, статья 1997.http://algolist.manual.ru/maths/graphs/shortpath/smartmove.php
53. Статья по алгоритму A*. Amit’s Thoughts on Path-Finding and A-Star http://theory.stanford.edu/~amitp/GameProgramming/index.html
54. Вишневский В.М., Железов P.B., Атанасова Т. Н. «Единая справочная система на пассажирском транспорте Российской Федерации», Distributed Computer and Communication Networks, Техносфера, 2005 — с. 165−172.
55. Rina D., Pearl J. Generalized best-first search strategies and the optimality of A*, 1985, Journal of the ACM 32 (3): p. 505 536.
56. Russell S. J., Norvig P. Artificial Intelligence: A Modern Approach, 2003, pp. 97−104. ISBN 0−13−790 395−2.
57. Wagner D., Willhalm T. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. Konstanzer Schriften in Mathematik und Informatik Nr. 183, Januar 2003 ISSN 1430{3558}
58. Delling D., Holzer M., M’uller K., Schulz F., Wagner D. High-performance multi-level graphs. In Proc. Workshop on DIMACS Shortest-Path Challenge, 2007, http://il lwww.ira.uka.de/members/mholzer/publications/pdf/dhmsw-hpmlg-06.pdf.
59. Березка М.П. Система управления пассажирскими перевозками «Экспресс-3» http ://www. express-2 .ru/express-3 / frame, htm
60. Справочный сайт о расписаниях транспорта в России, http://www.tutu.ru
61. Статичные расписания транспорта в России http://all-transport.info/
62. Общественный транспорт Google-Transit http://www.google.com/transit67. «Сирена-Трэвел о системе»: http://www.sirena-travel.ru/company/system/
63. Dantzig G. В. Linear Programming and Extensions. Princeton Univ. Press, Princeton, NJ, 1962.
64. Dreyfus D. An Appraisal of Some Shortest Path Algorithms. Technical Report RM-5433, Rand Corporation, Santa Monica, CA, 1967.
65. Goldberg A. V., Werneck R. F. Computing Point-to-Point Shortest Paths from External Memory. In Proc. 7th International Workshop on Algorithm Engineering and Experiments, pages 26{40. SIAM, 2005.
66. Nicholson T. A. J. Finding the Shortest Route Between Two Points in a Network. Computer J., 9:275−280, 1966.
67. Breslau L., Chao P., Fan L., Phillips G., Shenker S. On the implications of Zipf s lawfor Web caching. Proc. 3d Int. WWW Caching Workshop, Manchester, UK, June 1998.144
68. Claffy К., Braun H.-W., «Web traffic characterization: An assessment of the impact of caching documents from NCSA’s web server,» in Electronic Proc. 2nd World Wide Web Conf.'94: Mosaic and the Web, 1994.
69. Chankhunthod A. A hierarchical internet object cache, in Proc. 1996 USENIX Technical Conf., San Diego, CA, Jan. 1996.
70. Povey D., Harrison J. A distributed Internet cache, in Proc. 20th Australian Computer Science Conf., Sydney, Australia, Feb. 1997.
71. Tewari R., Dahlin M., Vin H. M., Kay J. S. Beyond hierarchies: Design considerations for disturbed caching on the Internet, in Proc. ICDCS '99 Conf., Austin, TX, May 1999.
72. Wessels D., Claffy K. Application of Internet cache protocol (ICP), version 2, Internet Engineering Task Force, Internet Draft: draft-wessels-icp-v2-appl-00. Work in Progress., May 1997.
73. Rousskov A., Wessels D. Cache digest, in Proc. 3rd Int. WWW Caching Workshop, June 1998, p. 272−273.
74. Fan L., Cao P., Almeida J., Broder A., Summary cache: A scalablewide-area web cache sharing protocol, in Proc. SIGCOMM'98, Feb. 1998, p. 254−265.
75. Valloppillil V., Ross K. W. Cache array routing protocol vl.l. Internet draft. Online], 1998, http://ds 1.internic.net/internetdrafts/draft-vinod-carp-v 1 -03.txt
76. Karger D., Sherman A., Berkhemier A., Bogstad В., Dhanidina R., Iwamoto K., Kim В., Matkins L., Yerushalmi Y. «Web caching with consistent hashing,» in Proc. 8th Int. World Wide Web Conf., May 1999.
77. Baentsch M., Baum L., Molter G., Rothkugel S., Sturm P. World Wide Web caching: The application-level view of the internet, IEEE Commun. Mag., p. 170−178, June 1997.
78. National Lab of Applied Network Research (NLANR). http://ircache.nlanr.net/
79. Vixie P., Wessels D. «RFC 2756: Hyper text caching protocol,"(HTCP/0.0), Jan. 2000.
80. Zipf G. K. Human Behavior and the Principle of Least Effort: An Introduction to Human Ecology. Reading, MA: Addison-Wesley, 1949.
81. Nonnenmacher J., Biersack E. W. Performance modeling of reliable multicast transmission, in Proc. IEEE INFOCOM'97, Apr. 1997.
82. Phillips G., Shenker S., Tangmunarunkit H. Scaling of multicast trees: Comments on the Chuang-Sirbu scaling law, in Proc. ACM SIGCOMM'99, Harvard, MA, Sept. 1999, pp. 4151.
83. Gribble S. Brewer E., System design issues for Internet middleware services: Deductions from a large client trace, in Proc. USENIX Symp. Internet Technologies and Systems, Dec. 1997.