{"id":"https://openalex.org/W647291347","doi":null,"title":"Equivalent Optimization Problem for Finding Equilibrium in the Bottleneck Model with Departure Time Choices","display_name":"Equivalent Optimization Problem for Finding Equilibrium in the Bottleneck Model with Departure Time Choices","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W647291347","mag":"647291347"},"language":"en","primary_location":{"id":"mag:647291347","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/839733","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047931123","display_name":"Takamasa Iryo","orcid":"https://orcid.org/0000-0003-0839-0835","observed_orcids":["https://orcid.org/0000-0003-0839-0835"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takamasa Iryo","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0839-0835","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108395632","display_name":"Toshio Yoshii","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Toshio Yoshii","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.22635069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.00860000029206276,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/departure-time-choice","display_name":"departure time choice","score":0.9890000224113464},{"id":"https://openalex.org/keywords/bottleneck-model","display_name":"bottleneck model","score":0.7739999890327454},{"id":"https://openalex.org/keywords/traffic-equilibrium","display_name":"traffic equilibrium","score":0.7549999952316284},{"id":"https://openalex.org/keywords/dynamic-traffic-assignment","display_name":"dynamic traffic assignment","score":0.9390000104904175},{"id":"https://openalex.org/keywords/linear-programming-formulation","display_name":"linear programming formulation","score":0.6899999976158142},{"id":"https://openalex.org/keywords/dual-problem","display_name":"dual problem","score":0.6880000233650208},{"id":"https://openalex.org/keywords/travel-cost","display_name":"travel cost","score":0.546999990940094},{"id":"https://openalex.org/keywords/schedule-constraints","display_name":"schedule constraints","score":0.5590000152587891}],"concepts":[{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6985809206962585},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6868373155593872},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.659079909324646},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6323326826095581},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5042673349380493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49866318702697754},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.4982583522796631},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.47832536697387695},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.45377710461616516},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4522380232810974},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.31385642290115356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23592519760131836},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:647291347","doi":null,"is_oa":false,"landing_page_url":"https://trid.trb.org/view/839733","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2330084221","https://openalex.org/W2370963422","https://openalex.org/W2163823867","https://openalex.org/W2903763735","https://openalex.org/W2017122858","https://openalex.org/W2135580136","https://openalex.org/W7099103406","https://openalex.org/W2959744331","https://openalex.org/W65856499","https://openalex.org/W2075493961"],"abstract_inverted_index":{"This":[0,85,99,171],"study":[1,72,86,172],"shows":[2,73,87,108,174],"an":[3,68,74,88],"equivalent":[4,79,93],"optimization":[5,69,75,89,131],"problem":[6,53,66,76,90,100,107,132],"for":[7,37,59],"finding":[8],"equilibrium":[9,64,82,96,116],"in":[10,115,127,189],"departure":[11,16,50,113,160],"time":[12,17,51],"choice":[13,18,52],"problem.":[14,70,84,98],"The":[15,71],"problem,":[19],"which":[20,77,91],"deals":[21],"with":[22],"dynamic":[23],"traffic":[24,41],"assignment":[25,65,83,97],"problems":[26,119],"while":[27],"considering":[28],"travelers\u2019":[29],"schedule":[30],"constraints,":[31],"is":[32,56,78,92,101],"one":[33],"of":[34,136,179],"famous":[35],"schemes":[36],"analyzing":[38],"the":[39,63,81,95,102,134,140,156,163,167,176,180,184,190],"time-dependent":[40],"flow.":[42],"There":[43],"are":[44],"many":[45],"existing":[46],"studies":[47],"related":[48],"to":[49,61,80,94,143],"but":[54],"it":[55,149],"not":[57],"common":[58],"them":[60],"replace":[62],"by":[67,183],"linear":[103],"program":[104],"whose":[105],"primal":[106],"how":[109],"travelers":[110],"choose":[111],"their":[112],"times":[114,161],"and":[117,124],"dual":[118],"calculate":[120],"delay":[121,144,191],"at":[122,145,192],"bottlenecks":[123,146,164],"travel":[125,137,169],"cost":[126,141,178],"equilibrium.":[128],"Because":[129],"this":[130],"minimizes":[133],"sum":[135],"costs":[138],"excluding":[139],"due":[142],"over":[147],"travelers,":[148],"can":[150],"be":[151],"said":[152],"that":[153,175],"policies":[154],"eliminating":[155],"queue":[157],"without":[158],"changing":[159],"from":[162],"will":[165],"minimize":[166],"total":[168],"cost.":[170],"also":[173],"external":[177],"congestion":[181],"made":[182],"additional":[185],"demand":[186],"only":[187],"appears":[188],"bottlenecks.":[193]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}