{"id":"https://openalex.org/W4308581149","doi":"https://doi.org/10.3390/a15110416","title":"An Algorithm for Generating a Diverse Set of Multi-Modal Journeys","display_name":"An Algorithm for Generating a Diverse Set of Multi-Modal Journeys","publication_year":2022,"publication_date":"2022-11-07","ids":{"openalex":"https://openalex.org/W4308581149","doi":"https://doi.org/10.3390/a15110416"},"language":"en","primary_location":{"id":"doi:10.3390/a15110416","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110416","pdf_url":"https://www.mdpi.com/1999-4893/15/11/416/pdf?version=1668592135","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/11/416/pdf?version=1668592135","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052926097","display_name":"Federico Mosquera-Guerra","orcid":"https://orcid.org/0000-0002-9824-8578"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Federico Mosquera","raw_affiliation_strings":["Department of Computer Science, KU Leuven, 9000 Gent, Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, 9000 Gent, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003769793","display_name":"Pieter Smet","orcid":"https://orcid.org/0000-0002-3955-7725"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Pieter Smet","raw_affiliation_strings":["Department of Computer Science, KU Leuven, 9000 Gent, Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, 9000 Gent, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051354803","display_name":"Greet Vanden Berghe","orcid":"https://orcid.org/0000-0002-0275-5568"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Greet Vanden Berghe","raw_affiliation_strings":["Department of Computer Science, KU Leuven, 9000 Gent, Belgium"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, 9000 Gent, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003769793"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.1489,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.41669446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"11","first_page":"416","last_page":"416"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9965000152587891,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/modal","display_name":"Modal","score":0.8158398866653442},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.740420401096344},{"id":"https://openalex.org/keywords/public-transport","display_name":"Public transport","score":0.6440486907958984},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6154257655143738},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6001293063163757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5311200618743896},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5015630722045898},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48014944791793823},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3218437433242798},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10569402575492859},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09500953555107117},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.09360665082931519}],"concepts":[{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.8158398866653442},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.740420401096344},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.6440486907958984},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6154257655143738},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6001293063163757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5311200618743896},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5015630722045898},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48014944791793823},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3218437433242798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10569402575492859},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09500953555107117},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.09360665082931519},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0},{"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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a15110416","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110416","pdf_url":"https://www.mdpi.com/1999-4893/15/11/416/pdf?version=1668592135","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/705802","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/705802","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Algorithms, vol. 15 (11), Art.No. 416","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:f5b6ab70efc04fd1bda3145a3310f761","is_oa":true,"landing_page_url":"https://doaj.org/article/f5b6ab70efc04fd1bda3145a3310f761","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 11, p 416 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/11/416/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15110416","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 11; Pages: 416","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15110416","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15110416","pdf_url":"https://www.mdpi.com/1999-4893/15/11/416/pdf?version=1668592135","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G3396399","display_name":null,"funder_award_id":"HBC.2017.0970","funder_id":"https://openalex.org/F4320313460","funder_display_name":"Agentschap Innoveren en Ondernemen"},{"id":"https://openalex.org/G485031124","display_name":null,"funder_award_id":"HBC.2017.0970","funder_id":"https://openalex.org/F4320321730","funder_display_name":"Fonds Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6377025376","display_name":null,"funder_award_id":"FWO-S007318N","funder_id":"https://openalex.org/F4320321730","funder_display_name":"Fonds Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7389070139","display_name":null,"funder_award_id":"FWO-S007318N","funder_id":"https://openalex.org/F4320313460","funder_display_name":"Agentschap Innoveren en Ondernemen"}],"funders":[{"id":"https://openalex.org/F4320313460","display_name":"Agentschap Innoveren en Ondernemen","ror":"https://ror.org/032xdry56"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4308581149.pdf","grobid_xml":"https://content.openalex.org/works/W4308581149.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W49244725","https://openalex.org/W1491427870","https://openalex.org/W1552451308","https://openalex.org/W1587851010","https://openalex.org/W1964915778","https://openalex.org/W1977943748","https://openalex.org/W2082795795","https://openalex.org/W2083019227","https://openalex.org/W2088769880","https://openalex.org/W2098090801","https://openalex.org/W2101810346","https://openalex.org/W2104317982","https://openalex.org/W2148831787","https://openalex.org/W2149964853","https://openalex.org/W2208227442","https://openalex.org/W2502134040","https://openalex.org/W2560519107","https://openalex.org/W2599817911","https://openalex.org/W2770729327","https://openalex.org/W2949470340","https://openalex.org/W2980304837","https://openalex.org/W3186417409","https://openalex.org/W4205498958","https://openalex.org/W4210315971","https://openalex.org/W4320350781","https://openalex.org/W6677339283"],"related_works":["https://openalex.org/W3001427781","https://openalex.org/W2379392295","https://openalex.org/W3160965418","https://openalex.org/W613940353","https://openalex.org/W2532234348","https://openalex.org/W2320915480","https://openalex.org/W2362990116","https://openalex.org/W2381300099","https://openalex.org/W108084911","https://openalex.org/W2107524205"],"abstract_inverted_index":{"A":[0,143],"direct":[1],"way":[2],"of":[3,7,65,76,79,88,135,166],"reducing":[4],"the":[5,10,77,85,93,164,167],"number":[6],"cars":[8],"on":[9,42,146],"road":[11],"is":[12,33,82,118],"to":[13,59,130,139,150,157],"dissuade":[14],"individuals":[15,39,48],"from":[16,71],"exclusively":[17],"using":[18],"their":[19,27],"car":[20],"and":[21,160],"instead":[22],"integrate":[23],"public":[24],"transport":[25,80,112],"into":[26],"daily":[28],"routine.":[29],"Planning":[30],"multi-modal":[31,89,137],"journeys":[32],"a":[34,53,63,101,115,132],"complex":[35],"task":[36],"for":[37],"which":[38],"often":[40],"rely":[41],"decision":[43],"support":[44],"tools.":[45],"However,":[46],"offering":[47],"different":[49,111],"journey":[50,66,90],"options":[51,67],"represents":[52],"significant":[54],"algorithmic":[55],"challenge.":[56],"The":[57],"failure":[58],"provide":[60],"users":[61,140],"with":[62,155],"set":[64,134],"that":[68,105,117],"differ":[69],"considerably":[70],"one":[72],"another":[73],"in":[74],"terms":[75],"modes":[78],"employed":[81],"currently":[83],"preventing":[84],"widespread":[86],"uptake":[87],"planning":[91],"among":[92],"general":[94],"public.":[95],"In":[96],"this":[97,107],"paper,":[98],"we":[99],"introduce":[100],"dynamic":[102],"programming":[103],"algorithm":[104],"remedies":[106],"situation":[108],"by":[109,121],"modeling":[110],"networks":[113,154],"as":[114],"graph":[116],"then":[119],"pruned":[120],"various":[122,151],"graph-reduction":[123],"pre-processing":[124],"techniques.":[125],"This":[126],"approach":[127],"enables":[128],"us":[129],"offer":[131],"diverse":[133],"efficient":[136],"solutions":[138],"almost":[141],"instantaneously.":[142],"computational":[144],"study":[145],"three":[147],"datasets":[148],"corresponding":[149],"real-world":[152],"mobility":[153],"up":[156],"30,000":[158],"vertices":[159],"596,000":[161],"arcs":[162],"demonstrates":[163],"effectiveness":[165],"proposed":[168],"algorithm.":[169]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}
