{"id":"https://openalex.org/W184668183","doi":"https://doi.org/10.1007/978-3-642-21705-0_9","title":"Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm","display_name":"Optimization of Multiple Traveling Salesmen Problem by a Novel Representation Based Genetic Algorithm","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W184668183","doi":"https://doi.org/10.1007/978-3-642-21705-0_9","mag":"184668183"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-21705-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21705-0_9","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/A5086723133","display_name":"Andr\u00e1s Kir\u00e1ly","orcid":null},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Andr\u00e1s Kir\u00e1ly","raw_affiliation_strings":["Department of Process Engineering, University of Pannonia, P.O. Box 158, Veszpr\u00e9m, H-8200, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Process Engineering, University of Pannonia, P.O. Box 158, Veszpr\u00e9m, H-8200, Hungary","institution_ids":["https://openalex.org/I140275651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063684561","display_name":"J\u00e1nos Abonyi","orcid":"https://orcid.org/0000-0001-8593-1493"},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"J\u00e1nos Abonyi","raw_affiliation_strings":["Department of Process Engineering, University of Pannonia, P.O. Box 158, Veszpr\u00e9m, H-8200, Hungary"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Process Engineering, University of Pannonia, P.O. Box 158, Veszpr\u00e9m, H-8200, Hungary","institution_ids":["https://openalex.org/I140275651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.0972,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.98058841,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T12176","display_name":"Optimization and Packing Problems","score":0.9932000041007996,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9141250848770142},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.7513842582702637},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7513532638549805},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7037851214408875},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6212241053581238},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.6135563254356384},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5971486568450928},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.5543642044067383},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5188235640525818},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4850165545940399},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.47111085057258606},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4482913613319397},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.417501300573349},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41133323311805725},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.31932324171066284}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9141250848770142},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.7513842582702637},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7513532638549805},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7037851214408875},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6212241053581238},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.6135563254356384},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5971486568450928},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.5543642044067383},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5188235640525818},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4850165545940399},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.47111085057258606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4482913613319397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.417501300573349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41133323311805725},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.31932324171066284},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-21705-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21705-0_9","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.548.8770","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.548.8770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://conf.uni-obuda.hu//cinti2009/30_cinti2009_submission.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W161573364","https://openalex.org/W215447973","https://openalex.org/W1482076823","https://openalex.org/W1497256448","https://openalex.org/W1510586458","https://openalex.org/W1559956479","https://openalex.org/W1571087346","https://openalex.org/W1573534773","https://openalex.org/W1586313000","https://openalex.org/W1588316353","https://openalex.org/W1977834049","https://openalex.org/W1983945124","https://openalex.org/W1997193586","https://openalex.org/W2002730737","https://openalex.org/W2004969812","https://openalex.org/W2006236904","https://openalex.org/W2007442224","https://openalex.org/W2022578518","https://openalex.org/W2036573713","https://openalex.org/W2041841351","https://openalex.org/W2050819731","https://openalex.org/W2055360661","https://openalex.org/W2059810217","https://openalex.org/W2068343681","https://openalex.org/W2069024107","https://openalex.org/W2071806120","https://openalex.org/W2075270510","https://openalex.org/W2098638888","https://openalex.org/W2100526970","https://openalex.org/W2118027456","https://openalex.org/W2119217175","https://openalex.org/W2138687204","https://openalex.org/W2140318223","https://openalex.org/W2147892615","https://openalex.org/W2153142800","https://openalex.org/W2167550287","https://openalex.org/W2168032099","https://openalex.org/W2168549096","https://openalex.org/W2184896964","https://openalex.org/W2322524800","https://openalex.org/W2325535142","https://openalex.org/W2340149117","https://openalex.org/W2405827726","https://openalex.org/W2484467825","https://openalex.org/W2504494713","https://openalex.org/W2513094291","https://openalex.org/W3023540311","https://openalex.org/W4299665420"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2361554335","https://openalex.org/W4220987199","https://openalex.org/W2171568915","https://openalex.org/W2946024655","https://openalex.org/W4246557197","https://openalex.org/W3013791021","https://openalex.org/W2758988501"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}