{"id":"https://openalex.org/W2912684174","doi":"https://doi.org/10.1109/umso.2018.8637246","title":"Toll Optimization Problems with Quadratic Costs","display_name":"Toll Optimization Problems with Quadratic Costs","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2912684174","doi":"https://doi.org/10.1109/umso.2018.8637246","mag":"2912684174"},"language":"en","primary_location":{"id":"doi:10.1109/umso.2018.8637246","doi":"https://doi.org/10.1109/umso.2018.8637246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/umso.2018.8637246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Unconventional Modelling, Simulation and Optimization - Soft Computing and Meta Heuristics - UMSO","raw_type":"proceedings-article"},"volume":null,"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/A5045452031","display_name":"Viacheslav V. Kalashnikov","orcid":"https://orcid.org/0000-0001-6747-580X","observed_orcids":["https://orcid.org/0000-0001-6747-580X","https://orcid.org/0000-0002-9178-8037","https://orcid.org/0000-0002-6824-8040"]},"institutions":[{"id":"https://openalex.org/I25822123","display_name":"Sumy State University","ror":"https://ror.org/01w60n236","country_code":"UA","type":"education","lineage":["https://openalex.org/I25822123"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Viacheslav Kalashnikov","raw_affiliation_strings":["Department of Computer Science, Sumy State University (SumDU), Sumy, Ukraine"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Sumy State University (SumDU), Sumy, Ukraine","institution_ids":["https://openalex.org/I25822123"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102762639","display_name":"Nataliya I. Kalashnykova","orcid":"https://orcid.org/0000-0002-3892-6605","observed_orcids":["https://orcid.org/0000-0002-3892-6605","https://orcid.org/0000-0002-2314-3106"]},"institutions":[{"id":"https://openalex.org/I169046204","display_name":"Universidad Aut\u00f3noma de Nuevo Le\u00f3n","ror":"https://ror.org/01fh86n78","country_code":"MX","type":"education","lineage":["https://openalex.org/I169046204"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Nataliya Kalashnykova","raw_affiliation_strings":["Department of Physics and Mathematics (FCFM), Universidad Aut\u00f3noma de Nuevo Le\u00f3n (UANL), San Nicol\u00e1s de los Garza, Nuevo Le\u00f3n, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physics and Mathematics (FCFM), Universidad Aut\u00f3noma de Nuevo Le\u00f3n (UANL), San Nicol\u00e1s de los Garza, Nuevo Le\u00f3n, Mexico","institution_ids":["https://openalex.org/I169046204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027465284","display_name":"Jos\u00e9 Guadalupe Flores-Mu\u00f1iz","orcid":"https://orcid.org/0000-0001-5318-5860","observed_orcids":["https://orcid.org/0000-0001-5318-5860","https://orcid.org/0000-0003-4837-2594"]},"institutions":[{"id":"https://openalex.org/I169046204","display_name":"Universidad Aut\u00f3noma de Nuevo Le\u00f3n","ror":"https://ror.org/01fh86n78","country_code":"MX","type":"education","lineage":["https://openalex.org/I169046204"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Jose G. Flores-Muniz","raw_affiliation_strings":["Department of Physics and Mathematics (FCFM), Universidad Aut\u00f3noma de Nuevo Le\u00f3n (UANL), San Nicol\u00e1s de los Garza, Nuevo Le\u00f3n, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Physics and Mathematics (FCFM), Universidad Aut\u00f3noma de Nuevo Le\u00f3n (UANL), San Nicol\u00e1s de los Garza, Nuevo Le\u00f3n, Mexico","institution_ids":["https://openalex.org/I169046204"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.23159509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9276999831199646,"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.9276999831199646,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.016100000590085983,"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"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.008700000122189522,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bi-level-optimization","display_name":"bi-level optimization","score":0.9769999980926514},{"id":"https://openalex.org/keywords/quadratic-cost-function","display_name":"quadratic cost function","score":0.8080000281333923},{"id":"https://openalex.org/keywords/traffic-equilibrium","display_name":"traffic equilibrium","score":0.6970000267028809},{"id":"https://openalex.org/keywords/transportation-networks","display_name":"transportation networks","score":0.3100000023841858},{"id":"https://openalex.org/keywords/traffic-congestion","display_name":"traffic congestion","score":0.7210000157356262},{"id":"https://openalex.org/keywords/sensitivity-analysis","display_name":"sensitivity analysis","score":0.6480000019073486},{"id":"https://openalex.org/keywords/filled-function-method","display_name":"filled function method","score":0.8220000267028809},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.8220000267028809},{"id":"https://openalex.org/keywords/toll-road-pricing","display_name":"toll road pricing","score":0.4950000047683716},{"id":"https://openalex.org/keywords/travel-cost-savings","display_name":"travel cost minimization","score":0.6819999814033508}],"concepts":[{"id":"https://openalex.org/C2778025104","wikidata":"https://www.wikidata.org/wiki/Q408004","display_name":"Toll","level":2,"score":0.785460352897644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7270288467407227},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.7187085747718811},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5860548615455627},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5565720796585083},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.535709023475647},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5353249907493591},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.49837255477905273},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.48578503727912903},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4849124550819397},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3543455898761749},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.32077330350875854},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25420981645584106},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/umso.2018.8637246","doi":"https://doi.org/10.1109/umso.2018.8637246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/umso.2018.8637246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Unconventional Modelling, Simulation and Optimization - Soft Computing and Meta Heuristics - UMSO","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5378999710083008,"id":"https://metadata.un.org/sdg/9"}],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W56282943","https://openalex.org/W60613359","https://openalex.org/W1497960242","https://openalex.org/W1520584263","https://openalex.org/W1988645991","https://openalex.org/W2013219867","https://openalex.org/W2018061857","https://openalex.org/W2030722820","https://openalex.org/W2046170418","https://openalex.org/W2071100254","https://openalex.org/W2107297922","https://openalex.org/W2111240209","https://openalex.org/W2171985270","https://openalex.org/W2303211571","https://openalex.org/W2499145065","https://openalex.org/W2557670160","https://openalex.org/W2602220366","https://openalex.org/W2616009639","https://openalex.org/W2951951756","https://openalex.org/W4251042257"],"related_works":["https://openalex.org/W3007423803","https://openalex.org/W2615061906","https://openalex.org/W2024119514","https://openalex.org/W107294591","https://openalex.org/W2303211571","https://openalex.org/W2602220366","https://openalex.org/W3090466100","https://openalex.org/W2561916901","https://openalex.org/W2035893651","https://openalex.org/W2139696051"],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,13,24,113,144,160,166,185],"bilevel":[3,141],"programming":[4,142],"problem":[5],"molding":[6],"the":[7,28,34,39,57,69,81,90,98,104,109,116,129,133,150,170,176,208],"optimal":[8],"toll":[9,16,29],"assignment":[10],"related":[11],"to":[12,43,63,80,97,138,184],"network":[14],"of":[15,74,128,149,169,187,194,201],"and":[17,203],"free":[18],"highways.":[19],"A":[20,192],"public":[21],"operator":[22],"or":[23],"private":[25],"company":[26],"running":[27],"roads":[30],"make":[31],"decisions":[32],"at":[33,72,165],"upper":[35],"level":[36,49,100,118],"by":[37,93],"alloting":[38],"tolls":[40],"in":[41],"order":[42,137],"maximize":[44],"their":[45,65,75,85],"profits.":[46],"The":[47],"lower":[48,99,117],"decision":[50],"makers":[51],"(highway":[52],"users),":[53],"instead,":[54],"look":[55],"for":[56,84,154],"equilibrium":[58],"among":[59],"them":[60],"while":[61],"attempting":[62],"arrange":[64],"transportation":[66],"flows":[67],"along":[68,132],"routes":[70],"aiming":[71],"minimization":[73],"total":[76,130],"travel":[77],"costs":[78,101,120],"subject":[79],"satisfied":[82],"demand":[83],"goods/passengers.":[86],"Our":[87],"model":[88],"extends":[89],"previous":[91],"ones":[92],"adding":[94],"quadratic":[95,119,155],"terms":[96],"thus":[102],"reflecting":[103],"mutual":[105],"traffic":[106],"congestion":[107],"on":[108,198],"roads.":[110],"Moreover,":[111],"as":[112],"new":[114,209],"feature,":[115],"aren't":[121],"separable":[122],"anymore,":[123],"i.e.,":[124],"they":[125],"are":[126],"functions":[127],"flow":[131],"arc":[134],"(highway).":[135],"In":[136],"solve":[139],"this":[140],"problem,":[143],"heuristic":[145],"algorithm":[146,210],"making":[147],"use":[148],"sensitivity":[151],"analysis":[152],"techniques":[153],"programs":[156],"is":[157,211],"developed.":[158],"As":[159],"remedy":[161],"against":[162],"being":[163],"stuck":[164],"local":[167,189],"maximum":[168,190],"upper-level":[171],"objective":[172],"function,":[173],"we":[174],"modify":[175],"well-known":[177],"\"filled":[178],"function\"":[179],"method":[180],"which":[181],"brings":[182],"us":[183],"neighborhood":[186],"another":[188],"point.":[191],"series":[193],"numerical":[195],"experiments":[196],"conducted":[197],"test":[199],"models":[200],"small":[202],"medium":[204],"size":[205],"shows":[206],"that":[207],"competitive":[212],"enough.":[213]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-11-01T11:40:01.658920","created_date":"2019-02-21T00:00:00"}