{"id":"https://openalex.org/W2734771754","doi":"https://doi.org/10.1145/3067695.3076064","title":"A memetic algorithm for computing multicriteria shortest paths in stochastic multimodal networks","display_name":"A memetic algorithm for computing multicriteria shortest paths in stochastic multimodal networks","publication_year":2017,"publication_date":"2017-07-11","ids":{"openalex":"https://openalex.org/W2734771754","doi":"https://doi.org/10.1145/3067695.3076064","mag":"2734771754"},"language":"en","primary_location":{"id":"doi:10.1145/3067695.3076064","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3067695.3076064","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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/A5002322637","display_name":"Omar Dib","orcid":"https://orcid.org/0000-0003-1372-0851"},"institutions":[{"id":"https://openalex.org/I3018083178","display_name":"Institut de Recherche Technologique SystemX","ror":"https://ror.org/03crmsn52","country_code":"FR","type":"facility","lineage":["https://openalex.org/I3018083178"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"O. Dib","raw_affiliation_strings":["IRT SystemX, Paris-Saclay, France","IRT SystemX (Institut de recherche technologique SystemX - 8 Avenue de la Vauve, 91120 Palaiseau - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRT SystemX, Paris-Saclay, France","institution_ids":["https://openalex.org/I3018083178"]},{"raw_affiliation_string":"IRT SystemX (Institut de recherche technologique SystemX - 8 Avenue de la Vauve, 91120 Palaiseau - France)","institution_ids":["https://openalex.org/I3018083178"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059527798","display_name":"Alexandre Caminada","orcid":"https://orcid.org/0000-0002-4088-7406"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Caminada","raw_affiliation_strings":["UTBM, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UTBM, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112296867","display_name":"M-A. Manier","orcid":null},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M-A. Manier","raw_affiliation_strings":["UTBM, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UTBM, France","institution_ids":["https://openalex.org/I37553959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055546112","display_name":"Laurent Moalic","orcid":"https://orcid.org/0000-0003-3749-3227"},"institutions":[{"id":"https://openalex.org/I37553959","display_name":"Universit\u00e9 de technologie de belfort-montb\u00e9liard","ror":"https://ror.org/05bn3m307","country_code":"FR","type":"education","lineage":["https://openalex.org/I37553959"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"L. Moalic","raw_affiliation_strings":["UTBM, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UTBM, France","institution_ids":["https://openalex.org/I37553959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9509,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73703704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9977999925613403,"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.9977999925613403,"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/T11106","display_name":"Data Management and Algorithms","score":0.9934999942779541,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9819999933242798,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.7935584783554077},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.720890998840332},{"id":"https://openalex.org/keywords/hill-climbing","display_name":"Hill climbing","score":0.5997628569602966},{"id":"https://openalex.org/keywords/multimodal-transport","display_name":"Multimodal transport","score":0.5661509037017822},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5567598938941956},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5533164739608765},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4992556571960449},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4965994954109192},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4603457450866699},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.441896915435791},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4390797019004822},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3227371275424957},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32228952646255493},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.24940690398216248},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24666696786880493},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14990773797035217},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10326668620109558},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.0990397036075592},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09099110960960388}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.7935584783554077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.720890998840332},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.5997628569602966},{"id":"https://openalex.org/C2777974031","wikidata":"https://www.wikidata.org/wiki/Q493641","display_name":"Multimodal transport","level":2,"score":0.5661509037017822},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5567598938941956},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5533164739608765},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4992556571960449},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4965994954109192},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4603457450866699},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.441896915435791},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4390797019004822},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3227371275424957},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32228952646255493},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.24940690398216248},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24666696786880493},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14990773797035217},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10326668620109558},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.0990397036075592},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09099110960960388},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3067695.3076064","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3067695.3076064","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-01586883v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01586883","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Genetic and Evolutionary Computation Conference Companion (GECCO 2017), Jul 2017, Berlin, Germany. pp.103-104, ⟨10.1145/3067695.3076064⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:HAL:hal-01761036v1","is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-01761036","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"the Genetic and Evolutionary Computation Conference Companion","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G6908018420","display_name":"SYSTEMX","funder_award_id":"ANR-10-AIRT-0008","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1998369658","https://openalex.org/W2529280371","https://openalex.org/W2560519107"],"related_works":["https://openalex.org/W2774602532","https://openalex.org/W2385780082","https://openalex.org/W2163647484","https://openalex.org/W1977672343","https://openalex.org/W2107915862","https://openalex.org/W1990478250","https://openalex.org/W2129420617","https://openalex.org/W3217012897","https://openalex.org/W144563559","https://openalex.org/W1988808191"],"abstract_inverted_index":{"Modern":[0],"transport":[1,50,109,125],"systems":[2],"are":[3],"nowadays":[4],"very":[5],"complex.":[6],"Building":[7],"Advanced":[8],"Travelers":[9],"Information":[10],"Systems":[11],"(ATIS)":[12],"has":[13],"therefore":[14],"become":[15],"a":[16,25,41,77,83,90,155],"certain":[17],"need.":[18],"Since":[19],"passengers":[20],"do":[21],"not":[22],"only":[23],"seek":[24],"short-time":[26],"travel,":[27],"but":[28],"they":[29],"tend":[30],"to":[31,75,99],"optimize":[32],"several":[33],"criteria,":[34],"an":[35,55],"efficient":[36],"routing":[37,62],"system":[38,51],"should":[39],"incorporate":[40],"multi-objective":[42],"analysis":[43],"into":[44,61],"its":[45,133],"search":[46,95],"process.":[47],"Besides,":[48],"the":[49,101,124,128,148],"may":[52,64],"behave":[53],"in":[54,81,97,106],"uncertain":[56],"manner.":[57],"Therefore,":[58],"integrating":[59],"uncertainty":[60],"algorithms":[63,141],"provide":[65,151],"better":[66,152],"itineraries.":[67],"The":[68],"main":[69],"objective":[70],"of":[71,127,130,158],"this":[72],"work":[73],"is":[74,87],"propose":[76],"Memetic":[78],"Approach":[79],"(MA)":[80],"which":[82],"Genetic":[84],"Algorithm":[85],"(GA)":[86],"combined":[88],"with":[89],"Hill":[91],"Climbing":[92],"(HC)":[93],"local":[94],"procedure":[96],"order":[98],"solve":[100],"multicriteria":[102],"shortest":[103],"path":[104],"problem":[105],"stochastic":[107],"multimodal":[108],"networks.":[110],"Experimental":[111],"results":[112],"have":[113],"been":[114],"assessed":[115],"by":[116],"solving":[117],"real":[118],"life":[119],"itinerary":[120],"problems":[121],"defined":[122],"on":[123],"network":[126],"city":[129],"Paris":[131],"and":[132,142,145],"suburbs.":[134],"Results":[135],"indicate":[136],"that":[137],"unlike":[138],"classical":[139],"deterministic":[140],"pure":[143],"GA":[144],"hill":[146],"climbing,":[147],"proposed":[149],"MA":[150],"itineraries":[153],"within":[154],"reasonable":[156],"amount":[157],"time.":[159]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}