{"id":"https://openalex.org/W2060741235","doi":"https://doi.org/10.1109/icsmc.2011.6083718","title":"A study on distributed parameter free genetic algorithm for TSP problem","display_name":"A study on distributed parameter free genetic algorithm for TSP problem","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2060741235","doi":"https://doi.org/10.1109/icsmc.2011.6083718","mag":"2060741235"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2011.6083718","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2011.6083718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Systems, Man, and Cybernetics","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/A5024550770","display_name":"Fumitaka Kondo","orcid":null},"institutions":[{"id":"https://openalex.org/I189513530","display_name":"Osaka Electro-Communication University","ror":"https://ror.org/056bksm23","country_code":"JP","type":"education","lineage":["https://openalex.org/I189513530"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Fumitaka Kondo","raw_affiliation_strings":["Osaka Electro-Communication University, Neyagawa, Osaka, Japan","Osaka Electro-Communication Univ., Neyagawa (Japan)"],"affiliations":[{"raw_affiliation_string":"Osaka Electro-Communication University, Neyagawa, Osaka, Japan","institution_ids":["https://openalex.org/I189513530"]},{"raw_affiliation_string":"Osaka Electro-Communication Univ., Neyagawa (Japan)","institution_ids":["https://openalex.org/I189513530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109403823","display_name":"Toshihiko Watanabe","orcid":null},"institutions":[{"id":"https://openalex.org/I189513530","display_name":"Osaka Electro-Communication University","ror":"https://ror.org/056bksm23","country_code":"JP","type":"education","lineage":["https://openalex.org/I189513530"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshihiko Watanabe","raw_affiliation_strings":["Osaka Electro-Communication University, Neyagawa, Osaka, Japan","Osaka Electro-Communication Univ., Neyagawa (Japan)"],"affiliations":[{"raw_affiliation_string":"Osaka Electro-Communication University, Neyagawa, Osaka, Japan","institution_ids":["https://openalex.org/I189513530"]},{"raw_affiliation_string":"Osaka Electro-Communication Univ., Neyagawa (Japan)","institution_ids":["https://openalex.org/I189513530"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024550770"],"corresponding_institution_ids":["https://openalex.org/I189513530"],"apc_list":null,"apc_paid":null,"fwci":0.4276,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72239661,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"j81 d 2","issue":null,"first_page":"675","last_page":"680"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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.998199999332428,"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.9900000095367432,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6975459456443787},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6623256802558899},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.6587462425231934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6298388242721558},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6017880439758301},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.536994457244873},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.5197048783302307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5053315758705139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27534908056259155}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6975459456443787},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6623256802558899},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.6587462425231934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6298388242721558},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6017880439758301},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.536994457244873},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.5197048783302307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5053315758705139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27534908056259155},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2011.6083718","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2011.6083718","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Systems, Man, and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1485961250","https://openalex.org/W2002648043","https://openalex.org/W2024060531","https://openalex.org/W2042986967","https://openalex.org/W2048716718","https://openalex.org/W3023540311","https://openalex.org/W3177272602","https://openalex.org/W6628974897","https://openalex.org/W6636850861","https://openalex.org/W7070245154"],"related_works":["https://openalex.org/W2031035514","https://openalex.org/W2064754602","https://openalex.org/W2369480021","https://openalex.org/W1483787881","https://openalex.org/W2350523565","https://openalex.org/W2130815404","https://openalex.org/W2021835904","https://openalex.org/W3182481902","https://openalex.org/W2386922710","https://openalex.org/W2355676621"],"abstract_inverted_index":{"Recently,":[0],"Genetic":[1],"Algorithm":[2],"has":[3],"been":[4],"studied":[5],"as":[6],"an":[7],"effective":[8],"approach":[9],"for":[10],"large":[11],"scale":[12],"optimization":[13],"problems.":[14],"However,":[15],"we":[16,51,75],"have":[17],"issues":[18],"of":[19,24,67,73,82,91,96,101],"early":[20],"convergence":[21],"and":[22,42,64],"settings":[23],"many":[25],"parameters":[26],"in":[27,85],"the":[28,70,77,80,88,97,102],"GA":[29],"approach.":[30],"In":[31,48],"order":[32],"to":[33,104],"deal":[34],"with":[35,87],"such":[36],"issues,":[37],"parameter":[38,55,61],"free":[39,56,62],"genetic":[40,44,57],"algorithm(PfGA)":[41],"distributed":[43,54,71],"algorithm(DGA)":[45],"were":[46],"proposed.":[47],"this":[49],"paper,":[50],"propose":[52,76],"a":[53],"algorithm(DPfGA)":[58],"that":[59],"keeps":[60],"characteristic":[63],"improves":[65],"efficiency":[66],"optimization.":[68,92],"Besides":[69],"construction":[72],"GA,":[74],"method":[78],"varying":[79],"number":[81],"offspring":[83],"adaptively":[84],"accordance":[86],"current":[89],"performance":[90],"We":[93],"show":[94],"effectiveness":[95],"algorithm":[98,103],"through":[99],"application":[100],"TSP(Travelling":[105],"Salesman":[106],"Problem).":[107]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}