{"id":"https://openalex.org/W2617456703","doi":"https://doi.org/10.1007/978-3-319-59060-8_58","title":"A DSS Based on Hybrid Ant Colony Optimization Algorithm for the TSP","display_name":"A DSS Based on Hybrid Ant Colony Optimization Algorithm for the TSP","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2617456703","doi":"https://doi.org/10.1007/978-3-319-59060-8_58","mag":"2617456703"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-59060-8_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-59060-8_58","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5008704409","display_name":"Islem Kaabachi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Islem Kaabachi","raw_affiliation_strings":["LARODEC Laboratory, Higher Institute of Management, University of Tunis, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LARODEC Laboratory, Higher Institute of Management, University of Tunis, Tunis, Tunisia","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062227768","display_name":"Dorra Jriji","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorra Jriji","raw_affiliation_strings":["LARODEC Laboratory, Higher Institute of Management, University of Tunis, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LARODEC Laboratory, Higher Institute of Management, University of Tunis, Tunis, Tunisia","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021582108","display_name":"Saoussen Krichen","orcid":"https://orcid.org/0000-0003-0347-6808"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saoussen Krichen","raw_affiliation_strings":["LARODEC Laboratory, Higher Institute of Management, University of Tunis, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LARODEC Laboratory, Higher Institute of Management, University of Tunis, Tunis, Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5008704409"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4154,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.61516663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"645","last_page":"654"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9973000288009644,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8175739049911499},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7672780156135559},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.741248607635498},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6294727921485901},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.569654643535614},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.564643144607544},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.48414286971092224},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4491467773914337},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44371411204338074},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23034659028053284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17572656273841858},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.05869355797767639}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8175739049911499},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7672780156135559},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.741248607635498},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6294727921485901},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.569654643535614},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.564643144607544},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.48414286971092224},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4491467773914337},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44371411204338074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23034659028053284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17572656273841858},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.05869355797767639},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-59060-8_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-59060-8_58","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W626292722","https://openalex.org/W1540674639","https://openalex.org/W1566652554","https://openalex.org/W1608651154","https://openalex.org/W1717440967","https://openalex.org/W1933569933","https://openalex.org/W1964959815","https://openalex.org/W1974579840","https://openalex.org/W1985440868","https://openalex.org/W1988360713","https://openalex.org/W1999459553","https://openalex.org/W2004182374","https://openalex.org/W2008023055","https://openalex.org/W2027486685","https://openalex.org/W2044430013","https://openalex.org/W2054706926","https://openalex.org/W2072635641","https://openalex.org/W2075270510","https://openalex.org/W2081231516","https://openalex.org/W2105112568","https://openalex.org/W2107941094","https://openalex.org/W2124993036","https://openalex.org/W2145324497","https://openalex.org/W2154929945","https://openalex.org/W2324108981","https://openalex.org/W2543892080","https://openalex.org/W2561675875","https://openalex.org/W4253500057"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W3159037256","https://openalex.org/W2208777194","https://openalex.org/W2908391583","https://openalex.org/W2406404685","https://openalex.org/W2369428395","https://openalex.org/W2530777107","https://openalex.org/W2572756133"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}