{"id":"https://openalex.org/W655857044","doi":null,"title":"An Efficient Implementation of Origin-Destination Demand Adjustment Problem using Column Generation","display_name":"An Efficient Implementation of Origin-Destination Demand Adjustment Problem using Column Generation","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W655857044","mag":"655857044"},"language":"en","primary_location":{"id":"mag:655857044","doi":null,"is_oa":false,"landing_page_url":"http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/33280","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/A5080915893","display_name":"Taehyung Park","orcid":"https://orcid.org/0000-0003-0631-3027","observed_orcids":["https://orcid.org/0000-0003-0631-3027","https://orcid.org/0009-0008-9064-2862"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Taehyung Park","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0631-3027","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071647554","display_name":"Sangkeon Lee","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sangkeon Lee","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":0,"citation_normalized_percentile":{"value":0.18584461,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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.9369999766349792,"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.9369999766349792,"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.013700000010430813,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.006000000052154064,"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/bi-level-optimization","display_name":"bi-level optimization","score":0.7929999828338623},{"id":"https://openalex.org/keywords/column-generation","display_name":"column generation","score":0.8519999980926514},{"id":"https://openalex.org/keywords/gradient-projection-method","display_name":"gradient projection","score":0.7149999737739563},{"id":"https://openalex.org/keywords/generalized-least-squares","display_name":"generalized least squares","score":0.7620000243186951},{"id":"https://openalex.org/keywords/non-negativity-constraints","display_name":"nonnegativity constraints","score":0.8289999961853027},{"id":"https://openalex.org/keywords/sioux-falls-network","display_name":"Sioux Falls network","score":0.7080000042915344}],"concepts":[{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.7304718494415283},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6590059995651245},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.565396249294281},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5221319794654846},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4989144802093506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4664651155471802},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4547842741012573},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.44319653511047363},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4275622069835663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41621652245521545},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:655857044","doi":null,"is_oa":false,"landing_page_url":"http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/33280","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":[{"id":"https://metadata.un.org/sdg/9","score":0.7207000255584717,"display_name":"Industry, innovation and infrastructure"},{"id":"https://metadata.un.org/sdg/11","score":0.5142999887466431,"display_name":"Sustainable cities and communities"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W123166913","https://openalex.org/W4389504498","https://openalex.org/W2128998818","https://openalex.org/W2076550881","https://openalex.org/W2025175289","https://openalex.org/W2067017204","https://openalex.org/W2081968398","https://openalex.org/W1867233773","https://openalex.org/W581583467","https://openalex.org/W2033332536"],"abstract_inverted_index":{"In":[0,117],"this":[1,118],"paper,":[2],"we":[3,120,190],"propose":[4],"an":[5],"efficient":[6],"implementation":[7],"scheme":[8],"for":[9,86,94,133],"the":[10,26,40,56,66,74,78,82,87,95,101,107,113,130,134,147,166,197],"origin-destination":[11],"matrix":[12],"adjustment":[13],"problem":[14,24,29,35,43,137],"(DAP).":[15],"DAP":[16],"is":[17,30,44,60,69,100,106,156,204],"usually":[18],"formulated":[19,45],"as":[20,46,71],"a":[21,31,47,123,160,177],"bilevel":[22],"optimization":[23,97],"where":[25],"upper":[27,67,88],"level":[28,42,68,76,80,136,168],"generalized":[32],"least":[33],"squares":[34],"with":[36,129],"non-negativity":[37],"constraints":[38],"and":[39,77,143,176,186],"lower":[41,75,79,135,167],"fixed":[48],"demand":[49,63,111],"traffic":[50],"assignment":[51],"problem.":[52,169],"Typical":[53],"iteration":[54],"of":[55,109,153,201],"bi-level":[57,96],"programming":[58,98],"approach":[59,99,127,155,203],"that":[61,105,122,157],"OD":[62,110,188],"produced":[64],"from":[65],"used":[70],"input":[72,92],"to":[73,165,196],"updates":[81],"optimal":[83],"link":[84,102,115,140],"flows":[85],"level.":[89],"The":[90],"key":[91],"data":[93],"proportion":[103,108,141],"parameter":[104],"in":[112],"current":[114],"flow.":[116],"research,":[119],"show":[121],"simple":[124],"projected":[125],"gradient":[126],"combined":[128],"column":[131],"generation":[132],"can":[138],"produce":[139],"explicitly":[142],"converges":[144],"fast":[145],"using":[146],"second":[148],"derivative":[149],"information.":[150],"Another":[151],"benefit":[152],"our":[154,192,202],"it":[158],"provides":[159],"good":[161],"feasible":[162],"initial":[163],"solution":[164],"Using":[170],"Sioux":[171],"Falls":[172],"network,":[173,175],"Winnipeg":[174],"large":[178],"scale":[179],"network":[180],"having":[181],"1,859":[182],"nodes,":[183],"4,776":[184],"links,":[185],"15,582":[187],"pairs,":[189],"demonstrate":[191],"algorithm.":[193],"Possible":[194],"extension":[195],"real":[198],"time":[199],"application":[200],"introduced.":[205]},"counts_by_year":[],"updated_date":"2026-09-24T07:57:37.273135","created_date":"2016-06-24T00:00:00"}