{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1363388845373199488.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1016/0191-2615(96)00003-3"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:0191261596000033?httpAccept=text/xml"}},{"identifier":{"@type":"URI","@value":"https://api.elsevier.com/content/article/PII:0191261596000033?httpAccept=text/plain"}}],"dc:title":[{"@value":"Cyclic flows, Markov process and stochastic traffic assignment"}],"description":[{"notation":[{"@value":"Abstract   Dial's stochastic assignment algorithm restricts the assignment path set to “efficient path.” As a result, it sometimes produces the unrealistic flow pattern that no flow is loaded on some paths where many vehicles are running in reality. To remove the drawback of Dial's algorithm, this paper presents the LOGIT type assignment that does not restrict the assignment paths. We first show the theoretical relation between the proposed model and Sasaki's assignment model through Markov process. This analysis makes it clear that the proposed assignment model can be calculated by some matrix operations. Next, we propose an efficient algorithm that does not require the matrix operation nor path enumeration over a network. The algorithm solves an equivalent program based on the entropy decomposition derived from the Markov property of LOGIT model. Finally, it is shown that the proposed approach can be easily extended to the flow dependent case (i.e. stochastic equilibrium assignment)."}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1383388845373199488","@type":"Researcher","foaf:name":[{"@value":"Takashi Akamatsu"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"01912615"}],"prism:publicationName":[{"@value":"Transportation Research Part B: Methodological"}],"dc:publisher":[{"@value":"Elsevier BV"}],"prism:publicationDate":"1996-10","prism:volume":"30","prism:number":"5","prism:startingPage":"369","prism:endingPage":"386"},"reviewed":"false","dcterms:accessRights":"http://purl.org/coar/access_right/c_abf2","dc:rights":["https://www.elsevier.com/tdm/userlicense/1.0/"],"url":[{"@id":"https://api.elsevier.com/content/article/PII:0191261596000033?httpAccept=text/xml"},{"@id":"https://api.elsevier.com/content/article/PII:0191261596000033?httpAccept=text/plain"}],"createdAt":"2003-05-19","modifiedAt":"2019-04-15","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360002216185102592","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A hyperpath-based network generalized extreme-value model for route choice under uncertainties"}]},{"@id":"https://cir.nii.ac.jp/crid/1360013168829270272","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Markovian traffic equilibrium assignment based on network generalized extreme value model"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285707406328448","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Developments in the theory of randomized shortest paths with a comparison of graph node distances"}]},{"@id":"https://cir.nii.ac.jp/crid/1360285708831249920","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Mathematical Analysis of Electric Vehicle Movement With Respect To Multiple Charging Stops"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567185372454912","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"The Sum-over-Forests Density Index: Identifying Dense Regions in a Graph"}]},{"@id":"https://cir.nii.ac.jp/crid/1360584340719859968","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Global path preference and local response: A reward decomposition approach for network path choice analysis in the presence of visually perceived attributes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360846641115267328","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"A discounted recursive logit model for dynamic gridlock network analysis"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848657467280256","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Prism-based path set restriction for solving Markovian traffic assignment problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593705156992","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Impact of transport network disruption on travel demand: A case study of the July 2018 heavy rain disaster in Japan"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861705577765376","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Capturing positive network attributes during the estimation of recursive logit models: A prism-based approach"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204110075648","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"SPATIAL INTERACTION MODEL FOR TRIP-CHAINING BEHAVIOR    WITH A FOCUS ON CALCULATION EFFICIENCY"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204213503360","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Pedestrian Activity Assignment Problem with Time-Space Constraint and Path Correlation"},{"@language":"ja","@value":"時空間制約と経路相関を考慮した歩行者の活動配分問題"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204374424320","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A New Multi-Path Routing Methodology Based on Logit-Type Probability Assignment"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001205356540544","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"ネットワーク上の空間計画に向けた観測と行動モデルの展開"},{"@language":"en","@value":"OBSERVATION AND BEHAVIOR MODELS FOR SPATIAL PLANNING IN NETWORKS"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001205357183232","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"時間構造化ネットワーク上の確率的交通配分"},{"@language":"en","@value":"STOCHASTIC ASSIGNMENT IN TIME-STRUCTURED NETWORKS"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001288107997184","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"車種及び距離帯を考慮した貨物車経路選択行動のモデル分析"},{"@language":"en","@value":"AN ANALYSIS OF TRUCKS' ROUTE CHOICE BEHAVIOR CONSIDERING VEHICLE TYPE AND TRIP LENGTH"}]},{"@id":"https://cir.nii.ac.jp/crid/1390012711625498496","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"AN EFFICIENT MATCHING MECHANISM FOR LARGE-SCALE CROWDSOURCED DELIVERY SYSTEMS: A GENERALIZED MODEL WITH PRICE ELASTICITY OF SUPPLY AND DEMAND"},{"@language":"ja","@value":"大規模クラウドソース配送システムの効率的マッチング・メカニズム：需給の価格弾力性を考慮した一般化"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679191280896","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Absorbing Markov Chain Traffic Flow Assignment Using a Dynamic Route Choice Model"},{"@language":"ja","@value":"動的経路選択モデルを用いた吸収マルコフ連鎖交通量配分"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679760838528","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"ESTIMATING PEDESTRIANS' ROUTE CHOICE PROBABILITY IN UNDERGROUND SPACE BASED ON OD MATRIX AND FLOW COUNT DATA"},{"@language":"ja","@value":"歩行者交通量に基づく地下空間における歩行者の経路選択確率の推定"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282680229487744","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"CATASTROPHE AVERSE STRATEGIES FOR ROUTING AND SITING IN THE DISPOSAL OF HAZARDOUS MATERIALS"},{"@language":"ja","@value":"危険物輸送のためのカタストロフ回避戦略"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282680332264960","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"測位値に基づく歩行経路の逐次推定におけるネットワークの誤差に関する検討"},{"@language":"en","@value":"MAP MATCHING METHOD WITH CONSIDERATION OF ERROR IN NETWORK COORDINATES"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282680333316096","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"ja","@value":"Network GEV型経路選択モデルを用いた確率的利用者均衡配分"},{"@language":"en","@value":"STOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT WITH A NETWORK GEV BASED ROUTE CHOICE MODEL"},{"@language":"ja-Kana","@value":"Network GEVガタ ケイロ センタク モデル オ モチイタ カクリツテキ リヨウシャ キンコウ ハイブン"}]},{"@id":"https://cir.nii.ac.jp/crid/1390283659846064512","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Semi-dynamic Markovian Path Flow Estimator Considering the Inconsistencies of Traffic Counts"}]},{"@id":"https://cir.nii.ac.jp/crid/1390565134811856000","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"LINK-BASED APPROACH FOR SEMI-DYNAMIC STOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT WITH SENSITIVITY ANALYSIS MODEL"}]},{"@id":"https://cir.nii.ac.jp/crid/1390845702312018688","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Estimation of Route Choice Model with Euler - Lagrange Observation based on Information Theory"},{"@language":"ja","@value":"オイラー・ラグランジュ型観測に基づく経路選択モデルの情報量推定"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1016/0191-2615(96)00003-3"},{"@type":"OPENAIRE","@value":"doi_dedup___::77ebdfa5d136d83421cf2dfe7329b7c4"},{"@type":"CROSSREF","@value":"10.1061/(asce)ey.1943-7897.0000356_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.trb.2019.02.002_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.15807/jorsj.58.247_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejipm.74.i_657_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.11361/journalcpij.54.726_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.trb.2021.10.013_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejipm.78.4_190_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejipm.73.i_549_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.11361/journalcpij.51.680_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.eastsj.2020.100017_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1109/tpami.2013.227_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.trc.2015.05.015_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejd.63.509_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.trc.2017.10.001_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.tra.2024.103998_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1587/transcom.e94.b.2282_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.11361/journalcpij.48.447_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.eastsj.2022.100057_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.trc.2023.104014_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejipm.71.i_1_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejipm.73.186_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejipm.70.i_611_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.3130/aija.82.2285_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.1016/j.physa.2013.09.016_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"},{"@type":"CROSSREF","@value":"10.2208/jscejipm.75.i_615_references_DOI_Cud2ElNLyTEbrRvEDVNEckmAtCX"}]}