{"id":"https://openalex.org/W4308087760","doi":"https://doi.org/10.1109/ds-rt55542.2022.9932045","title":"A Distributed Memetic Algorithm with a semi-greedy operator for the Traveling Salesman Problem","display_name":"A Distributed Memetic Algorithm with a semi-greedy operator for the Traveling Salesman Problem","publication_year":2022,"publication_date":"2022-09-26","ids":{"openalex":"https://openalex.org/W4308087760","doi":"https://doi.org/10.1109/ds-rt55542.2022.9932045"},"language":"en","primary_location":{"id":"doi:10.1109/ds-rt55542.2022.9932045","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ds-rt55542.2022.9932045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM 26th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","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/A5039217404","display_name":"Manuella Germanos","orcid":null},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Manuella Germanos","raw_affiliation_strings":["Lebanese American University,Department of Computer Science & Mathematics,Byblos,Lebanon"],"affiliations":[{"raw_affiliation_string":"Lebanese American University,Department of Computer Science & Mathematics,Byblos,Lebanon","institution_ids":["https://openalex.org/I56306041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047508564","display_name":"Danielle Azar","orcid":"https://orcid.org/0000-0002-6159-3714"},"institutions":[{"id":"https://openalex.org/I56306041","display_name":"Lebanese American University","ror":"https://ror.org/00hqkan37","country_code":"LB","type":"education","lineage":["https://openalex.org/I56306041"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Danielle Azar","raw_affiliation_strings":["Lebanese American University,Department of Computer Science & Mathematics,Byblos,Lebanon"],"affiliations":[{"raw_affiliation_string":"Lebanese American University,Department of Computer Science & Mathematics,Byblos,Lebanon","institution_ids":["https://openalex.org/I56306041"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037693487","display_name":"Abir Karami","orcid":"https://orcid.org/0000-0003-1972-5629"},"institutions":[{"id":"https://openalex.org/I181827316","display_name":"Universit\u00e9 Catholique de Lille","ror":"https://ror.org/025s1b152","country_code":"FR","type":"education","lineage":["https://openalex.org/I181827316"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Abir Beatrice Karami","raw_affiliation_strings":["FGES, Université Catholique de Lille, F-59000 Lille, France","SILEX - Supporting Interaction and Learning by Experience (France)"],"affiliations":[{"raw_affiliation_string":"FGES, Université Catholique de Lille, F-59000 Lille, France","institution_ids":["https://openalex.org/I181827316"]},{"raw_affiliation_string":"SILEX - Supporting Interaction and Learning by Experience (France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009657115","display_name":"Jalal Possik","orcid":"https://orcid.org/0000-0002-5246-8102"},"institutions":[{"id":"https://openalex.org/I181827316","display_name":"Universit\u00e9 Catholique de Lille","ror":"https://ror.org/025s1b152","country_code":"FR","type":"education","lineage":["https://openalex.org/I181827316"]},{"id":"https://openalex.org/I4210113150","display_name":"Laboratoire Interdisciplinaire de Physique","ror":"https://ror.org/023n9q531","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I4210113150","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jalal Possik","raw_affiliation_strings":["FGES, Université Catholique de Lille, F-59000 Lille, France","LITL - Laboratoire Interdisciplinaire des transitions de Lille (France)"],"affiliations":[{"raw_affiliation_string":"FGES, Université Catholique de Lille, F-59000 Lille, France","institution_ids":["https://openalex.org/I181827316"]},{"raw_affiliation_string":"LITL - Laboratoire Interdisciplinaire des transitions de Lille (France)","institution_ids":["https://openalex.org/I4210113150"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039217404"],"corresponding_institution_ids":["https://openalex.org/I56306041"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.124104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"143","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.989799976348877,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9449999928474426,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8697117567062378},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.8567676544189453},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.8174191117286682},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6962883472442627},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6906698942184448},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6440169811248779},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.643913984298706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6227277517318726},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5761218667030334},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5487774014472961},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5387241840362549},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5260222554206848},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.507792055606842},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.48357266187667847},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3760617673397064},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.32537633180618286},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3182637095451355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3096231520175934},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22148582339286804}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8697117567062378},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8567676544189453},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8174191117286682},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6962883472442627},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6906698942184448},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6440169811248779},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.643913984298706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6227277517318726},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5761218667030334},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5487774014472961},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5387241840362549},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5260222554206848},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.507792055606842},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.48357266187667847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3760617673397064},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.32537633180618286},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3182637095451355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3096231520175934},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22148582339286804},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ds-rt55542.2022.9932045","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ds-rt55542.2022.9932045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE/ACM 26th International Symposium on Distributed Simulation and Real Time Applications (DS-RT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04511576v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04511576","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DS-RT 2022 IEEE/ACM 26th International Symposium on Distributed Simulation and Real Time Applications, Sep 2022, Al\u00e8s, France. pp.143-150, ⟨10.1109/DS-RT55542.2022.9932045⟩","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391264787","https://openalex.org/W2140187183","https://openalex.org/W2804769572","https://openalex.org/W2946294588","https://openalex.org/W2766468404","https://openalex.org/W1548562700","https://openalex.org/W2185228534","https://openalex.org/W2244079844","https://openalex.org/W2571130378","https://openalex.org/W4393234433"],"abstract_inverted_index":{"In":[0,47],"this":[1],"work,":[2],"we":[3,50],"propose":[4],"a":[5,23],"distributed":[6],"Memetic":[7],"Algorithm":[8],"for":[9],"the":[10,29,32,40,48,52,62,66,83],"traveling":[11],"salesman":[12],"problem":[13],"focusing":[14],"on":[15,80],"small":[16],"and":[17,35,60],"medium-sized":[18],"instances.":[19],"The":[20],"algorithm":[21],"employs":[22],"new":[24],"crossover":[25],"operator":[26],"that":[27,70],"favors":[28],"fitter":[30],"of":[31,65],"two":[33],"parents":[34,42],"develops":[36],"varying":[37],"progeny":[38],"from":[39,82],"same":[41],"to":[43,56],"evade":[44],"premature":[45],"convergence.":[46],"implementation,":[49],"use":[51],"High-Level":[53],"Architecture":[54],"(HLA)":[55],"distribute":[57],"laborious":[58],"tasks":[59],"lower":[61],"lead":[63],"time":[64],"heuristic.":[67],"Results":[68],"show":[69],"our":[71],"proposed":[72],"approach":[73],"significantly":[74],"outperforms":[75],"other":[76],"algorithms":[77],"when":[78],"tested":[79],"instances":[81],"TSPLIB":[84],"benchmark.":[85]},"counts_by_year":[],"updated_date":"2026-03-26T15:22:09.906841","created_date":"2025-10-10T00:00:00"}