{"id":"https://openalex.org/W2568881022","doi":"https://doi.org/10.1109/cdc.2016.7798510","title":"Some novel traffic coordination problems and their analytical study based on Lagrangian Duality theory","display_name":"Some novel traffic coordination problems and their analytical study based on Lagrangian Duality theory","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2568881022","doi":"https://doi.org/10.1109/cdc.2016.7798510","mag":"2568881022"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2016.7798510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2016.7798510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 55th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"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/A5045014678","display_name":"Greyson Daugherty","orcid":"https://orcid.org/0000-0001-6359-0552"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Greyson Daugherty","raw_affiliation_strings":["School of Industrial & Systems Engineering Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008675858","display_name":"Spyros Reveliotis","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spyros Reveliotis","raw_affiliation_strings":["School of Industrial & Systems Engineering Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Industrial & Systems Engineering Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015816401","display_name":"Greg Mohler","orcid":"https://orcid.org/0000-0001-7330-5962"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Greg Mohler","raw_affiliation_strings":["Georgia Tech Research Institute Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Tech Research Institute Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":null,"first_page":"1701","last_page":"1708"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.8111230134963989},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6512487530708313},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6414028406143188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6069722175598145},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4983072280883789},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4743049144744873},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.46406421065330505},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.45001477003097534},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4488152861595154},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.42334675788879395},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41094833612442017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3006822168827057},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12207582592964172},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10627719759941101}],"concepts":[{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.8111230134963989},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6512487530708313},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6414028406143188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6069722175598145},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4983072280883789},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4743049144744873},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46406421065330505},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.45001477003097534},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4488152861595154},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.42334675788879395},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41094833612442017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3006822168827057},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12207582592964172},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10627719759941101},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2016.7798510","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2016.7798510","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 55th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W10024846","https://openalex.org/W322937049","https://openalex.org/W1496620875","https://openalex.org/W1507539267","https://openalex.org/W1542172960","https://openalex.org/W1587663028","https://openalex.org/W1968143987","https://openalex.org/W2059878106","https://openalex.org/W2064378637","https://openalex.org/W2080403682","https://openalex.org/W2088304441","https://openalex.org/W2098432798","https://openalex.org/W2137890200","https://openalex.org/W2137920965","https://openalex.org/W2139211712","https://openalex.org/W2140153029","https://openalex.org/W2145493798","https://openalex.org/W2145493994","https://openalex.org/W2150473588","https://openalex.org/W2344384429","https://openalex.org/W2489145936","https://openalex.org/W2505968561","https://openalex.org/W2509841691","https://openalex.org/W2990961515","https://openalex.org/W4212851288","https://openalex.org/W4242130683","https://openalex.org/W4253331343","https://openalex.org/W4254313632","https://openalex.org/W6841587223"],"related_works":["https://openalex.org/W4237964977","https://openalex.org/W2002102264","https://openalex.org/W2155100848","https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W2075228635","https://openalex.org/W3097196196","https://openalex.org/W4247364272","https://openalex.org/W3183857959","https://openalex.org/W3083877676"],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2,12,79,93,105],"class":[3],"of":[4,11,14,20,33,82,96,104,115,137],"scheduling":[5,85],"problems":[6,26,86],"that":[7,40,56,68],"concern":[8],"the":[9,18,31,54,60,64,83,102,110,116,126,135,142],"routing":[10,139],"set":[13],"mobile":[15],"agents":[16],"over":[17],"edges":[19],"an":[21],"underlying":[22],"guidepath":[23],"network.":[24],"These":[25],"are":[27,41,69],"motivated":[28],"by":[29,52],"(i)":[30],"operations":[32,55,67],"some":[34],"unit-load,":[35],"automated":[36],"material":[37],"handling":[38],"systems":[39],"employed":[42,70],"in":[43,59,71],"many":[44],"contemporary":[45],"production":[46],"and":[47,50,100,112,130],"distribution":[48],"facilities,":[49],"also":[51],"(ii)":[53],"take":[57],"place":[58],"physical":[61],"layouts":[62],"implementing":[63],"elementary":[65],"logical":[66],"quantum":[72],"computing.":[73],"The":[74,120],"presented":[75],"results":[76],"include":[77],"(a)":[78],"systematic":[80,111],"formulation":[81],"considered":[84],"as":[87],"mixed":[88],"integer":[89],"programs":[90],"(MIPs),":[91],"(b)":[92],"Lagrangian":[94],"relaxation":[95],"these":[97],"MIP":[98,128],"formulations,":[99],"(c)":[101],"development":[103],"customized":[106],"dual-ascent":[107],"algorithm":[108],"for":[109,125,134,141],"expedient":[113],"solution":[114],"corresponding":[117],"dual":[118],"problem.":[119],"latter":[121],"provides":[122],"lower":[123],"bounds":[124],"original":[127,143],"formulations":[129],"potentially":[131],"useful":[132],"information":[133],"construction":[136],"near-optimal":[138],"schedules":[140],"problems.":[144]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}