Probabilistic travel time based route choice problem with a hierarchical path enumeration algorithm (Record no. 92194)

MARC details
000 -LEADER
fixed length control field 03477nas a2200397 a 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260818174131.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 100305s2009 th uu|m rtt 0| a1eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b12073945
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT Thesis no.TE-08-04
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Maribojoc, Theonette Ruba
245 10 - TITLE STATEMENT
Title Probabilistic travel time based route choice problem with a hierarchical path enumeration algorithm
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Pathum Thani, Thailand :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 2009
300 ## - PHYSICAL DESCRIPTION
Extent 61 leaves :
Other physical details ill.
490 1# - SERIES STATEMENT
Series statement Thesis ;
Volume/sequential designation no. TE-08-04
500 ## - GENERAL NOTE
General note A thesis submitted in partial fulfillment of the re quirements for the degree of Master of Engineering in Transportation Engineering, School of Engineering and Technology
520 ## - SUMMARY, ETC.
Summary, etc. It has long been aimed by transportation researcher s to solve the unmanageable urban traffic congestion all over the world. RGS and ATIS are amo ng the useful ITS applications for urban passenger car travel. However, available mode ls used in evaluating their effectiveness have not precisely imitated the real transportation network. For example, many of the previous studies avoided path enumeration, route ch oice models were formulated without integrating the driver{u2019}s perception error, etc. All of the aforementioned issues are significant in a route choice model{u2019}s efficiency. Moreover, in traffic assignment and network design problems, reliable route choice models are very essential. The proposed route choice model is provided with an efficient path enumeration algorithm. The combined concepts of hierarchical road classifi cation, resource constraints, link penalty and the link-based shortest path searching algorith m successfully enumerated independent paths; manifested through the choice probability re sults of the deterministic multinomial logit (MNL) model. In addition, the model calculates the path choice probabilities both when a reference travel time frame is known and unknown. U sing a network in Bangkok, Thailand, the proposed model was examined and the calculated path choice probabilities were compared to the Success Rate (SR) and deterministic MNL. Significant advantages of the proposed model over the conventional MNL were estab lished.
502 ## - DISSERTATION NOTE
Dissertation note Thesis (M.Eng.) - Asian Institute of Technology, 2008
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Transportation
Geographic subdivision Thailand
-- Bangkok
General subdivision Planning
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Route choice
Geographic subdivision Thailand
-- Bangkok
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Kim, Hyunmyung,
Relator term Chaiperson
700 0# - ADDED ENTRY--PERSONAL NAME
Personal name Kunnawee Kanitpong,
Relator term Examination committee
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Tanaka, Shinji,
Relator term Examination committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Thailand (HM King),
Relator term Scholarship donor
810 2# - SERIES ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Asian Institute of Technology.
Title of a work Thesis ;
Volume/sequential designation no. TE-08-04
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href="http://203.159.5.9/ait-thesis/detail.php?q=B04093 ">http://203.159.5.9/ait-thesis/detail.php?q=B04093 </a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b12073945
b mnait
c u
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 240329
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 0
Cataloger's initials, CIN (RLIN) 100305
First date, FD (RLIN) m
-- a
-- u
-- 0
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 22-AIT Thesis (Replacement)
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 40-Archives
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120704043
CREATED CREATED : 2014-09-04
RECORD Id RECORD # : i12788399
LPATRON LPATRON : 1025582
LCHKIN LCHKIN : 2016-03-05
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 1
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050160041736
CREATED CREATED : 2016-03-24
RECORD Id RECORD # : i12907285
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 18/08/2026 50.00   AIT Thesis no.TE-08-04 30050120704043 18/08/2026 3 18/08/2026 22-AIT Thesis (Replacement)
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 18/08/2026     AIT Thesis no.TE-08-04 30050160041736 18/08/2026   18/08/2026 40-Archives
คัดลอกแล้ว!