{"id":"https://openalex.org/W1502284724","doi":"https://doi.org/10.1007/978-0-387-74161-1_5","title":"Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm","display_name":"Solving Traveling Salesman Problem Using Combinational Evolutionary Algorithm","publication_year":2007,"publication_date":"2007-11-09","ids":{"openalex":"https://openalex.org/W1502284724","doi":"https://doi.org/10.1007/978-0-387-74161-1_5","mag":"1502284724"},"language":"en","primary_location":{"id":"doi:10.1007/978-0-387-74161-1_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-74161-1_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-74161-1_5.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP The International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-74161-1_5.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003490724","display_name":"Mohammad Reza Bonyadi","orcid":"https://orcid.org/0000-0003-0061-4902"},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mohammad Reza Bonyadi","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Shahid Beheshti University, Tehran, Iran","shahid beheshti University"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Shahid Beheshti University, Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"shahid beheshti University","institution_ids":["https://openalex.org/I48379061"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065710228","display_name":"S. Mostafa Rahimi Azghadi","orcid":null},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. Mostafa Rahimi Azghadi","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Shahid Beheshti University, Tehran, Iran","shahid beheshti University"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Shahid Beheshti University, Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"shahid beheshti University","institution_ids":["https://openalex.org/I48379061"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006111932","display_name":"Hamed Shah\u2010Hosseini","orcid":"https://orcid.org/0000-0002-3969-4973"},"institutions":[{"id":"https://openalex.org/I48379061","display_name":"Shahid Beheshti University","ror":"https://ror.org/0091vmj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I48379061"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hamed Shah Hosseini","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Shahid Beheshti University, Tehran, Iran","shahid beheshti University"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Shahid Beheshti University, Tehran, Iran","institution_ids":["https://openalex.org/I48379061"]},{"raw_affiliation_string":"shahid beheshti University","institution_ids":["https://openalex.org/I48379061"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003490724"],"corresponding_institution_ids":["https://openalex.org/I48379061"],"apc_list":null,"apc_paid":null,"fwci":6.9032,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.96743472,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"37","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11220","display_name":"Water Systems and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11220","display_name":"Water Systems and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/T10969","display_name":"Water resources management and optimization","score":0.9628000259399414,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9382352828979492},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6003707051277161},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5774067044258118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5740459561347961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5136939287185669},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5009613037109375},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4571409821510315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.451956182718277},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.43897098302841187},{"id":"https://openalex.org/keywords/christofides-algorithm","display_name":"Christofides algorithm","score":0.42673566937446594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36084264516830444}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9382352828979492},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6003707051277161},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5774067044258118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5740459561347961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5136939287185669},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5009613037109375},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4571409821510315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.451956182718277},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.43897098302841187},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.42673566937446594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36084264516830444},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-0-387-74161-1_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-74161-1_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-74161-1_5.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP The International Federation for Information Processing","raw_type":"book-chapter"},{"id":"pmh:oai:espace.library.uq.edu.au:UQ:396064","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402388","display_name":"Queensland's institutional digital repository (The University of Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165143802","host_organization_name":"The University of Queensland","host_organization_lineage":["https://openalex.org/I165143802"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":{"id":"doi:10.1007/978-0-387-74161-1_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-0-387-74161-1_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-0-387-74161-1_5.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP The International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1502284724.pdf","grobid_xml":"https://content.openalex.org/works/W1502284724.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1979356488","https://openalex.org/W1983362322","https://openalex.org/W2097571405","https://openalex.org/W2106905228","https://openalex.org/W2122410182","https://openalex.org/W2624262714","https://openalex.org/W2752853835","https://openalex.org/W2752885492","https://openalex.org/W6725038865","https://openalex.org/W6744529318"],"related_works":["https://openalex.org/W1595757466","https://openalex.org/W2766731260","https://openalex.org/W2980689483","https://openalex.org/W2171568915","https://openalex.org/W1645834615","https://openalex.org/W2620231896","https://openalex.org/W2356976268","https://openalex.org/W2586589655","https://openalex.org/W2991484371","https://openalex.org/W2140187183"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,27],"proposed":[4],"a":[5],"new":[6,31],"method":[7,19,32],"to":[8],"solve":[9],"TSP":[10],"(Traveling":[11],"Salesman":[12],"Problem)":[13],"based":[14,38],"on":[15,39],"evolutionary":[16],"algorithms.":[17],"This":[18],"can":[20,33],"be":[21],"used":[22],"for":[23,65],"related":[24],"problems":[25,37],"and":[26,49,62],"found":[28],"out":[29],"the":[30,46],"works":[34],"properly":[35],"in":[36,57],"permutation.":[40],"We":[41],"compare":[42],"our":[43,52],"results":[44],"by":[45],"previous":[47],"algorithms":[48,61],"show":[50],"that":[51],"algorithm":[53],"needs":[54],"less":[55],"time":[56],"comparison":[58],"with":[59],"known":[60],"so":[63],"efficient":[64],"such":[66],"problems.":[67]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}