{"id":"https://openalex.org/W7123337105","doi":"https://doi.org/10.1109/cdc57313.2025.11312299","title":"Optimization methods to improve the quality of a cycling network under budget constraints","display_name":"Optimization methods to improve the quality of a cycling network under budget constraints","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123337105","doi":"https://doi.org/10.1109/cdc57313.2025.11312299"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312299","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"article","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/A5103239847","display_name":"Rafael Praxedes","orcid":"https://orcid.org/0000-0003-0123-0337"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Rafael Praxedes","raw_affiliation_strings":["University of Parma,Department of Engineering and Architecture,Parma,Italy,43124"],"affiliations":[{"raw_affiliation_string":"University of Parma,Department of Engineering and Architecture,Parma,Italy,43124","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122901520","display_name":"Anand Subramanian","orcid":null},"institutions":[{"id":"https://openalex.org/I2799978770","display_name":"X-Fab (Germany)","ror":"https://ror.org/030bh9196","country_code":"DE","type":"company","lineage":["https://openalex.org/I2799978770"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anand Subramanian","raw_affiliation_strings":["Universidade Federal da Paraíba,Departamento de Computação Científica,João Pessoa,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal da Paraíba,Departamento de Computação Científica,João Pessoa,Brazil","institution_ids":["https://openalex.org/I2799978770"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073881613","display_name":"Stefano Ardizzoni","orcid":"https://orcid.org/0000-0003-1426-0834"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Ardizzoni","raw_affiliation_strings":["University of Parma,Department of Engineering and Architecture,Parma,Italy,43124"],"affiliations":[{"raw_affiliation_string":"University of Parma,Department of Engineering and Architecture,Parma,Italy,43124","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048869539","display_name":"Luca Consolini","orcid":"https://orcid.org/0000-0002-3577-9398"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Consolini","raw_affiliation_strings":["University of Parma,Department of Engineering and Architecture,Parma,Italy,43124"],"affiliations":[{"raw_affiliation_string":"University of Parma,Department of Engineering and Architecture,Parma,Italy,43124","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025409316","display_name":"Mattia Laurini","orcid":"https://orcid.org/0000-0001-9965-8803"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mattia Laurini","raw_affiliation_strings":["University of Parma,Department of Engineering and Architecture,Parma,Italy,43124"],"affiliations":[{"raw_affiliation_string":"University of Parma,Department of Engineering and Architecture,Parma,Italy,43124","institution_ids":["https://openalex.org/I124601658"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037434863","display_name":"Marco Locatelli","orcid":"https://orcid.org/0000-0003-0778-3653"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Locatelli","raw_affiliation_strings":["University of Parma,Department of Engineering and Architecture,Parma,Italy,43124"],"affiliations":[{"raw_affiliation_string":"University of Parma,Department of Engineering and Architecture,Parma,Italy,43124","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5103239847"],"corresponding_institution_ids":["https://openalex.org/I124601658"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.77815619,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4982","last_page":"4987"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10298","display_name":"Urban Transport and Accessibility","score":0.5180000066757202,"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/T10298","display_name":"Urban Transport and Accessibility","score":0.5180000066757202,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.05779999867081642,"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.03629999980330467,"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/heuristics","display_name":"Heuristics","score":0.7330999970436096},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7056999802589417},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7023000121116638},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5654000043869019},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.4690999984741211},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.451200008392334},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3659999966621399},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.36239999532699585}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7330999970436096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7063999772071838},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7056999802589417},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7023000121116638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.652400016784668},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5654000043869019},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.4690999984741211},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.451200008392334},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3659999966621399},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.36239999532699585},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C541528975","wikidata":"https://www.wikidata.org/wiki/Q53121","display_name":"Cycling","level":2,"score":0.35359999537467957},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3345000147819519},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312299","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312299","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0,103],"well-designed":[1],"cycling":[2,29,38,91],"network":[3,14,39,92],"is":[4,16,61,131,141],"fundamental":[5],"to":[6,65,76,81,84,125,154,170],"stimulating":[7],"bicycle":[8],"use.":[9],"The":[10,115],"evaluation":[11],"of":[12,28,119,136,146,167,182,200],"the":[13,26,78,86,150,156,165,180],"quality":[15],"a":[17,134],"complex":[18],"process,":[19],"that":[20],"involves":[21],"multiple":[22],"criteria,":[23],"such":[24],"as":[25,94],"connectivity":[27],"paths,":[30],"road":[31],"safety,":[32],"and":[33,51,109,211],"other":[34],"factors.":[35],"An":[36],"ideal":[37],"provides":[40],"cycle":[41],"paths":[42],"along":[43],"all":[44],"roads,":[45],"completely":[46],"separated":[47],"from":[48],"car":[49],"traffic,":[50],"built":[52],"with":[53,123,133,164],"high-quality":[54,202],"materials.":[55],"However,":[56],"in":[57,90,144,207],"practice,":[58],"achieving":[59],"this":[60,69,139],"very":[62],"difficult":[63],"due":[64],"budget":[66,101,126],"constraints.":[67,102],"In":[68],"paper,":[70],"we":[71,174],"propose":[72,175],"an":[73],"optimization":[74],"strategy":[75],"select":[77],"best":[79],"interventions":[80],"be":[82,194],"applied":[83],"achieve":[85],"highest":[87],"possible":[88],"improvement":[89],"quality,":[93],"perceived":[95],"by":[96],"users,":[97],"taking":[98],"into":[99],"account":[100],"Mixed-Integer":[104],"Linear":[105],"Programming":[106],"(MILP)":[107],"formulation":[108],"three":[110],"solution":[111,130,181],"methods":[112],"are":[113,186,198],"proposed.":[114],"first":[116],"method":[117,140],"consists":[118],"enumerating":[120],"feasible":[121],"solutions":[122,203],"respect":[124],"constraints,":[127],"where":[128],"each":[129],"associated":[132],"subset":[135],"interventions.":[137,168],"Although":[138,191],"more":[142],"efficient":[143,206],"terms":[145],"memory":[147,212],"usage":[148],"than":[149],"commercial":[151],"CPLEX":[152],"solver":[153],"solve":[155],"MILP":[157],"problem,":[158],"its":[159],"computation":[160],"times":[161],"increase":[162],"exponentially":[163],"number":[166],"Therefore,":[169],"improve":[171],"computational":[172,209],"time,":[173],"two":[176],"heuristics":[177],"based":[178],"on":[179],"knapsack":[183],"problems,":[184],"which":[185],"solved":[187],"using":[188],"dynamic":[189],"programming.":[190],"optimality":[192],"cannot":[193],"guaranteed,":[195],"these":[196],"approximations":[197],"capable":[199],"providing":[201],"while":[204],"being":[205],"both":[208],"time":[210],"usage.":[213]},"counts_by_year":[],"updated_date":"2026-01-14T00:46:21.520733","created_date":"2026-01-14T00:00:00"}