An approach to the transit passenger assignment with its application to metropolitan Manila 大量輸送機関配分の一方法とそのマニラ首都圏への適用

この論文をさがす

著者

    • 井田, 徹 イダ, トオル

書誌事項

タイトル

An approach to the transit passenger assignment with its application to metropolitan Manila

タイトル別名

大量輸送機関配分の一方法とそのマニラ首都圏への適用

著者名

井田, 徹

著者別名

イダ, トオル

学位授与大学

京都大学

取得学位

博士 (工学)

学位授与番号

乙第8059号

学位授与年月日

1993-01-23

注記・抄録

博士論文

目次

  1. 論文目録 / (0001.jp2)
  2. TABLE OF CONTENTS / (0008.jp2)
  3. 1 INTRODUCTION / p1 (0012.jp2)
  4. 2 CHARACTERISTICS OF THE TRANSIT SERVICE IN METRO MANILA / p4 (0014.jp2)
  5. 2.1 THE PROFILE OF METRO MANILA / p4 (0014.jp2)
  6. 2.2 URBAN TRANSPORTATION IN METRO MANILA / p12 (0018.jp2)
  7. 2.3 THE URBAN TRANSIT IN METRO MANILA / p31 (0027.jp2)
  8. 3 APPROACHES TO THE TRIP ASSIGNMENT TO THE TRANSIT NETWORK / p50 (0037.jp2)
  9. 3.1 THE EXISTING TRANSIT ASSIGNMENT MODELS / p50 (0037.jp2)
  10. 3.2 PROBLEMS IDENTIFIED FOR THE TRANSIT ASSIGNMENT / p56 (0040.jp2)
  11. 3.3 SOLUTIONS BY THE EXISTING MODELS / p62 (0043.jp2)
  12. 3.4 CURRENT FINDINGS RELATED TO SERVICE WAITING / p67 (0045.jp2)
  13. 4 SHORTEST PATH SEARCH IN THE TRANSIT NETWORK / p71 (0047.jp2)
  14. 4.1 THE PROPERTIES OF THE TRANSIT NETWORK / p71 (0047.jp2)
  15. 4.2 A FEASIBLE APPROACH / p73 (0048.jp2)
  16. 4.3 THE PROPOSED MODEL / p78 (0051.jp2)
  17. 5 ISSUES ASSOCIATED WITH WAITING FOR A TRANSIT SERVICE / p86 (0055.jp2)
  18. 5.1 THE WAITING TIME FOR A SERVICE / p89 (0056.jp2)
  19. 5.2 THE PASSENGER SPLIT AMONG PARALLEL LINES / p102 (0063.jp2)
  20. 5.3 THE SHIFT FROM THE SHORTEST PATH / p106 (0065.jp2)
  21. 6 THE COMPUTER PROGRAM PACKAGE FOR THE TRIP ASSIGNMENT / p127 (0075.jp2)
  22. 6.1 THE DESIGN CONCEPT OF THE PACKAGE / p127 (0075.jp2)
  23. 6.2 THE FUNCTIONS OF THE PACKAGE / p129 (0076.jp2)
  24. 6.3 THE COMPONENTS OF THE PACKAGE / p144 (0084.jp2)
  25. 6.4 THE COMPUTER SYSTEM FOR THE PACKAGE / p146 (0085.jp2)
  26. 7 APPLICATION OF THE TRIP ASSIGNMENT MODEL TO METRO MANILA / p148 (0086.jp2)
  27. 7.1 DATA SOURCES / p148 (0086.jp2)
  28. 7.2 DATA ANALYSIS AND PROCESS / p153 (0088.jp2)
  29. 7.3 THE ASSIGNMENT COMPUTATION / p169 (0096.jp2)
  30. 7.4 ASSESSMENT OF THE ASSIGNMENT / p172 (0098.jp2)
  31. 8 CONCLUSION / p181 (0102.jp2)
  32. APPENDIX A ALGORITHMS FOR THE SHORTEST PATH SEARCH / A-1 / (0105.jp2)
  33. A.1 THE MOORE'S ALGORITHM / A-1 / (0105.jp2)
  34. A.2 THE DIJKSTRA'S ALGORITHM / A-3 / (0106.jp2)
  35. A.3 THE FLOYD'S ALGORITHM / A-6 / (0108.jp2)
  36. A.4 THE SHIMBEL'S ALGORITHM / A-8 / (0109.jp2)
  37. APPENDIX B PROBABILITY DISTRIBUTIONS OF THE ARRIVAL INTERVAL / B-1 / (0110.jp2)
  38. B.1 THE ARRIVAL PROBABILITY / B-1 / (0110.jp2)
  39. B.2 THE EXPONENTIAL DISTRIBUTION / B-8 / (0114.jp2)
  40. B.3 THE ERLANGIAN DISTRIBUTION / B-13 / (0116.jp2)
  41. B.4 THE HYPER-EXPONENTIAL DISTRIBUTION / B-19 / (0119.jp2)
  42. B.5 COMPARISON OF THE PROBABILITY DISTRIBUTIONS / B-24 / (0122.jp2)
  43. APPENDIX C GLOSSARY / C-1 / (0126.jp2)
  44. APPENDIX D REFERENCES / D-1 / (0128.jp2)
0アクセス

各種コード

  • NII論文ID(NAID)
    500000092478
  • NII著者ID(NRID)
    • 8000000092703
  • DOI(NDL)
  • NDL書誌ID
    • 000000256792
  • データ提供元
    • NDL-OPAC
    • NDLデジタルコレクション
ページトップへ