{"id":"https://openalex.org/W7130574602","doi":"https://doi.org/10.1109/fllm67465.2025.11391234","title":"Prompt to Path: LLM-Guided Multi-Objective Eco-Routing via Geohash-Compressed Urban Graphs","display_name":"Prompt to Path: LLM-Guided Multi-Objective Eco-Routing via Geohash-Compressed Urban Graphs","publication_year":2025,"publication_date":"2025-11-25","ids":{"openalex":"https://openalex.org/W7130574602","doi":"https://doi.org/10.1109/fllm67465.2025.11391234"},"language":"en","primary_location":{"id":"doi:10.1109/fllm67465.2025.11391234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fllm67465.2025.11391234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 3rd International Conference on Foundation and Large Language Models (FLLM)","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/A5122918430","display_name":"Madyan Omar Bagosher","orcid":null},"institutions":[{"id":"https://openalex.org/I29891158","display_name":"University of Sharjah","ror":"https://ror.org/00engpz63","country_code":"AE","type":"education","lineage":["https://openalex.org/I29891158"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"Madyan Bagosher","raw_affiliation_strings":["University of Sharjah,Department of Computer Science,Sharjah,United Arab Emirates"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sharjah,Department of Computer Science,Sharjah,United Arab Emirates","institution_ids":["https://openalex.org/I29891158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021583910","display_name":"Isam Mashhour Al Jawarneh","orcid":"https://orcid.org/0000-0002-4796-2181"},"institutions":[{"id":"https://openalex.org/I29891158","display_name":"University of Sharjah","ror":"https://ror.org/00engpz63","country_code":"AE","type":"education","lineage":["https://openalex.org/I29891158"]}],"countries":["AE"],"is_corresponding":false,"raw_author_name":"Isam Mashhour Al Jawarneh","raw_affiliation_strings":["University of Sharjah,Department of Computer Science,Sharjah,United Arab Emirates"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Sharjah,Department of Computer Science,Sharjah,United Arab Emirates","institution_ids":["https://openalex.org/I29891158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073919193","display_name":"Luca Foschini","orcid":"https://orcid.org/0000-0001-9062-3647"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Foschini","raw_affiliation_strings":["University of Bologna,Dipartimento di Informatica – Scienza e Ingegneria,Bologna,Italy,40136"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bologna,Dipartimento di Informatica – Scienza e Ingegneria,Bologna,Italy,40136","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107265509","display_name":"Paolo Bellavista","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Bellavista","raw_affiliation_strings":["University of Bologna,Dipartimento di Informatica – Scienza e Ingegneria,Bologna,Italy,40136"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bologna,Dipartimento di Informatica – Scienza e Ingegneria,Bologna,Italy,40136","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.16040000319480896,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.16040000319480896,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10298","display_name":"Urban Transport and Accessibility","score":0.11879999935626984,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.05849999934434891,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/scalability","display_name":"Scalability","score":0.7401000261306763},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5824000239372253},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5371999740600586},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.5004000067710876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4092999994754791},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.38179999589920044}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7408000230789185},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7401000261306763},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5824000239372253},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5371999740600586},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5004000067710876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.413100004196167},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4092999994754791},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.38179999589920044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36230000853538513},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.321399986743927},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C48677424","wikidata":"https://www.wikidata.org/wiki/Q6888088","display_name":"Mode (computer interface)","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.275299996137619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26579999923706055},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/fllm67465.2025.11391234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fllm67465.2025.11391234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 3rd International Conference on Foundation and Large Language Models (FLLM)","raw_type":"proceedings-article"},{"id":"pmh:oai:cris.unibo.it:11585/1049367","is_oa":false,"landing_page_url":"https://hdl.handle.net/11585/1049367","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7513910531997681,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2022485595","https://openalex.org/W2165558283","https://openalex.org/W2638424764","https://openalex.org/W2802694346","https://openalex.org/W2922186415","https://openalex.org/W2945340619","https://openalex.org/W3113896391","https://openalex.org/W3169776611","https://openalex.org/W4200015544","https://openalex.org/W4206614412","https://openalex.org/W4385658025","https://openalex.org/W4388430367","https://openalex.org/W4406761517","https://openalex.org/W4416034985"],"related_works":[],"abstract_inverted_index":{"Cycling":[0],"is":[1,36],"a":[2,46,71,114,129,145,152],"widely-practiced,":[3],"eco-friendly":[4],"mode":[5],"of":[6,48,102,164],"transportation":[7],"essential":[8],"for":[9,17,91,134,206],"sustainable":[10],"urban":[11],"mobility.":[12],"Determining":[13],"routes":[14,35],"that":[15,80,188],"optimize":[16],"environmental":[18,120],"factors,":[19],"such":[20],"as":[21,30,45],"better":[22],"air":[23],"quality":[24,163],"(AQ)":[25],"and":[26,57,161,175,182,199],"high":[27],"vegetation":[28],"(NDVI)":[29],"opposed":[31],"to":[32,59,86,139,150,197],"just":[33],"faster":[34],"an":[37],"important":[38],"first":[39,112],"step":[40],"in":[41,97],"incentivizing":[42],"bike":[43],"riding":[44],"form":[47],"transportation.":[49],"However,":[50],"existing":[51],"navigation":[52],"systems":[53],"often":[54],"fall":[55],"short":[56],"fail":[58],"facilitate":[60],"this":[61],"multi-objective,":[62],"environment":[63],"aware":[64],"routing.":[65],"To":[66],"address":[67],"this,":[68],"we":[69,111,143],"introduce":[70],"scalable":[72,141],"eco-routing":[73],"framework":[74],"Geohash-Based":[75],"Multi-Objective":[76],"Bike":[77],"Routing":[78],"(GB-MOBR),":[79],"leverages":[81],"Large":[82],"Language":[83],"Models":[84],"(LLMs)":[85],"interpret":[87],"natural":[88],"language":[89],"prompts":[90],"route":[92],"preferences.":[93],"The":[94],"challenge":[95],"lies":[96],"the":[98,159,202],"prohibitive":[99],"computational":[100],"cost":[101],"multi-objective":[103],"algorithms":[104,203],"with":[105,128],"large":[106],"scale":[107],"graph-based":[108],"networks.":[109],"Therefore,":[110],"construct":[113],"fine-grained,":[115],"multi-criteria":[116],"graph":[117,147],"by":[118,195],"associating":[119],"data":[121],"(AQ,":[122],"NDVI,":[123],"Congestion,":[124],"Green":[125],"Roofs,":[126],"Meteorological)":[127],"street":[130],"network":[131],"using":[132],"KD-Trees":[133],"efficient":[135],"spatial":[136],"matching.":[137],"Then,":[138],"enable":[140],"optimization,":[142],"apply":[144],"Geohash-based":[146],"aggregation":[148,190],"technique":[149],"create":[151],"smaller,":[153],"topologically":[154],"equivalent":[155],"graph.":[156],"We":[157],"compare":[158],"performance":[160],"solution":[162],"these":[165],"algorithms:":[166],"Genetic":[167],"Algorithm":[168],"(GA),":[169],"Particle":[170],"Swarm":[171],"Optimization":[172],"(PSO),":[173],"Dijkstra":[174],"Yen's":[176],"K-Shortest":[177],"Paths":[178],"on":[179],"both":[180],"graphs":[181],"examine":[183],"their":[184],"performance.":[185],"Results":[186],"demonstrate":[187],"our":[189],"method":[191],"reduces":[192],"computation":[193],"time":[194],"up":[196],"90%":[198],"therefore":[200],"making":[201],"more":[204],"viable":[205],"real-time":[207],"use.":[208]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-02-20T00:00:00"}