{"id":"https://openalex.org/W1548703119","doi":"https://doi.org/10.1007/978-3-540-78987-1_19","title":"Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem","display_name":"Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1548703119","doi":"https://doi.org/10.1007/978-3-540-78987-1_19","mag":"1548703119"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-78987-1_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-78987-1_19","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in Computational Intelligence","raw_type":"book-chapter"},"type":"book-chapter","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/A5113493762","display_name":"Gregory Gutin","orcid":null},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gregory Gutin","raw_affiliation_strings":["Department of Computer Science, Royal Holloway, University of London, Egham, UK","Department of Computer Science, Royal Holloway University of London  Egham UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway, University of London, Egham, UK","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Department of Computer Science, Royal Holloway University of London  Egham UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075467204","display_name":"Daniel Karapetyan","orcid":"https://orcid.org/0000-0003-4030-6525"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel Karapetyan","raw_affiliation_strings":["Department of Computer Science, Royal Holloway, University of London, Egham, UK","Department of Computer Science, Royal Holloway University of London  Egham UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Royal Holloway, University of London, Egham, UK","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Department of Computer Science, Royal Holloway University of London  Egham UK","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043620976","display_name":"Natalio Krasnogor","orcid":"https://orcid.org/0000-0002-2651-4320"},"institutions":[{"id":"https://openalex.org/I142263535","display_name":"University of Nottingham","ror":"https://ror.org/01ee9ar58","country_code":"GB","type":"education","lineage":["https://openalex.org/I142263535"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Natalio Krasnogor","raw_affiliation_strings":["Automatic Scheduling and Planning group, School of Computer Science and I.T., University of Nottingham, Nottingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automatic Scheduling and Planning group, School of Computer Science and I.T., University of Nottingham, Nottingham, UK","institution_ids":["https://openalex.org/I142263535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4303,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.9540636,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"199","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9944000244140625,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.972100019454956,"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/memetic-algorithm","display_name":"Memetic algorithm","score":0.9489086270332336},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.926193118095398},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7789421081542969},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.6730265617370605},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6255996227264404},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5820809602737427},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5660932660102844},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.49122947454452515},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.47423475980758667},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.4694157540798187},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.42644453048706055},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4250425398349762},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.377380907535553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3659592866897583},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16996175050735474}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.9489086270332336},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.926193118095398},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7789421081542969},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6730265617370605},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6255996227264404},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5820809602737427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5660932660102844},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.49122947454452515},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.47423475980758667},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.4694157540798187},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.42644453048706055},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4250425398349762},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.377380907535553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3659592866897583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16996175050735474}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-78987-1_19","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-78987-1_19","pdf_url":null,"source":{"id":"https://openalex.org/S2764461748","display_name":"Studies in computational intelligence","issn_l":"1860-949X","issn":["1860-949X","1860-9503"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Studies in Computational Intelligence","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1530715683","https://openalex.org/W1533818411","https://openalex.org/W1548164611","https://openalex.org/W1570131048","https://openalex.org/W1571087346","https://openalex.org/W1947393338","https://openalex.org/W2008656089","https://openalex.org/W2010113720","https://openalex.org/W2019741214","https://openalex.org/W2048296377","https://openalex.org/W2128435562","https://openalex.org/W2163428398","https://openalex.org/W2168079536","https://openalex.org/W2170186790"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W4220987199","https://openalex.org/W2359992618","https://openalex.org/W2362402143","https://openalex.org/W2766731260","https://openalex.org/W1966089951","https://openalex.org/W4214682618"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}