{"@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/1361418520459729280.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1287/trsc.12.3.200"}},{"identifier":{"@type":"URI","@value":"https://pubsonline.informs.org/doi/pdf/10.1287/trsc.12.3.200"}}],"dc:title":[{"@value":"Optimality Conditions for a Dynamic Traffic Assignment Model"}],"description":[{"type":"abstract","notation":[{"@value":"<jats:p> We consider a dynamic traffic assignment model formulated as a nonlinear and noneonvex mathematical program. Necessary optimality conditions require equalization of certain marginal costs for all the paths that are being used, and these optimality conditions are shown to be a generalization of the optimality conditions of a conventional static traffic assignment problem. We also examine the behavior of the dynamic model under static demand conditions and show that in this case our model is a generalized version of a standard static model. Our model suggests a promising refinement of the objective function for the static case. </jats:p>"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1381418520459729281","@type":"Researcher","foaf:name":[{"@value":"Deepak K. Merchant"}],"jpcoar:affiliationName":[{"@value":"Stanford Research Institute, Menlo Park, California"}]},{"@id":"https://cir.nii.ac.jp/crid/1381418520459729280","@type":"Researcher","foaf:name":[{"@value":"George L. Nemhauser"}],"jpcoar:affiliationName":[{"@value":"Cornell University, Ithaca, New York"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"00411655"},{"@type":"EISSN","@value":"15265447"}],"prism:publicationName":[{"@value":"Transportation Science"}],"dc:publisher":[{"@value":"Institute for Operations Research and the Management Sciences (INFORMS)"}],"prism:publicationDate":"1978-08","prism:volume":"12","prism:number":"3","prism:startingPage":"200","prism:endingPage":"207"},"reviewed":"false","url":[{"@id":"https://pubsonline.informs.org/doi/pdf/10.1287/trsc.12.3.200"}],"createdAt":"2008-10-31","modifiedAt":"2023-04-02","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360294643834682880","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Dynamic system optimal traffic assignment with atomic users: Convergence and stability"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001205308134912","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"DYNAMIC USER EQUILIBRIUM ASSIGNMENT ON OVERSATURATED ROAD NETWORKS"},{"@language":"ja","@value":"渋滞ネットワークにおける動的利用者均衡配分"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001205310176896","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"PREDICTIVE AND DYNAMIC USER OPTIMAL TRAFFIC ASSIGNMENT AS A TIME-DELAY OPTIMAL CONTROL PROBLEM"},{"@language":"ja","@value":"時間遅れをもつ最適制御問題としての動的利用者均衡配分"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1287/trsc.12.3.200"},{"@type":"CROSSREF","@value":"10.2208/jscej.1994.77_references_DOI_9Zg7y9kyEQETrG5ydg7vrPNwaCd"},{"@type":"CROSSREF","@value":"10.1016/j.trb.2021.11.001_references_DOI_9Zg7y9kyEQETrG5ydg7vrPNwaCd"},{"@type":"CROSSREF","@value":"10.2208/jscej.1994.488_21_references_DOI_9Zg7y9kyEQETrG5ydg7vrPNwaCd"}]}