{"id":"https://openalex.org/W2161235998","doi":"https://doi.org/10.4304/jcp.6.10.2173-2179","title":"Study of An Improved Genetic Algorithm Based on Fixed Point theory and hJ1 triangulation in Euclidean Space","display_name":"Study of An Improved Genetic Algorithm Based on Fixed Point theory and hJ1 triangulation in Euclidean Space","publication_year":2011,"publication_date":"2011-09-27","ids":{"openalex":"https://openalex.org/W2161235998","doi":"https://doi.org/10.4304/jcp.6.10.2173-2179","mag":"2161235998"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.6.10.2173-2179","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.10.2173-2179","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-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/A5039740996","display_name":"Jingjun Zhang","orcid":"https://orcid.org/0000-0001-8553-077X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jingjun Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042073512","display_name":"Hongxia Wang","orcid":"https://orcid.org/0000-0003-3062-4060"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hongxia Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5067063465","display_name":"Ruizhen Gao","orcid":"https://orcid.org/0000-0001-5127-6603"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ruizhen Gao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.18827167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"10","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14025","display_name":"Educational Technology and Assessment","score":0.90420001745224,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T14025","display_name":"Educational Technology and Assessment","score":0.90420001745224,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.7585705518722534},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.7577970027923584},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.6476343274116516},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.6309549808502197},{"id":"https://openalex.org/keywords/bowyer\u2013watson-algorithm","display_name":"Bowyer\u2013Watson algorithm","score":0.58165442943573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5729526281356812},{"id":"https://openalex.org/keywords/minimum-weight-triangulation","display_name":"Minimum-weight triangulation","score":0.5522416234016418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5229897499084473},{"id":"https://openalex.org/keywords/pitteway-triangulation","display_name":"Pitteway triangulation","score":0.5177990198135376},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46077650785446167},{"id":"https://openalex.org/keywords/point-set-triangulation","display_name":"Point set triangulation","score":0.4586924910545349},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44557029008865356},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4208085536956787},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.41204673051834106},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.41113489866256714},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41077131032943726},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28062039613723755},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.2530297040939331},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.19476205110549927},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07891520857810974}],"concepts":[{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.7585705518722534},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7577970027923584},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.6476343274116516},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.6309549808502197},{"id":"https://openalex.org/C121198538","wikidata":"https://www.wikidata.org/wiki/Q4951461","display_name":"Bowyer\u2013Watson algorithm","level":3,"score":0.58165442943573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5729526281356812},{"id":"https://openalex.org/C39969762","wikidata":"https://www.wikidata.org/wiki/Q6865406","display_name":"Minimum-weight triangulation","level":4,"score":0.5522416234016418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5229897499084473},{"id":"https://openalex.org/C178609930","wikidata":"https://www.wikidata.org/wiki/Q3538712","display_name":"Pitteway triangulation","level":3,"score":0.5177990198135376},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46077650785446167},{"id":"https://openalex.org/C167117609","wikidata":"https://www.wikidata.org/wiki/Q17078161","display_name":"Point set triangulation","level":3,"score":0.4586924910545349},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44557029008865356},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4208085536956787},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.41204673051834106},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.41113489866256714},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41077131032943726},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28062039613723755},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2530297040939331},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.19476205110549927},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07891520857810974},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.6.10.2173-2179","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.10.2173-2179","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2020241049"],"related_works":["https://openalex.org/W2350914983","https://openalex.org/W109258179","https://openalex.org/W4302417997","https://openalex.org/W1483219455","https://openalex.org/W2001351033","https://openalex.org/W113718658","https://openalex.org/W1996934342","https://openalex.org/W1972369894","https://openalex.org/W149465645","https://openalex.org/W2381084059"],"abstract_inverted_index":{"Aiming":[0],"at":[1],"the":[2,10,17,27,30,33,38,43,46,57,64,72,76,82,96,102,106,112,119],"convergence":[3,50],"precision":[4],"defects":[5],"of":[6,22,29,37,67,101],"standard":[7,120],"genetic":[8,18,121],"algorithm,":[9],"fixed":[11],"point":[12],"theory":[13],"is":[14,24],"introduced":[15],"into":[16,71],"algorithms.":[19],"The":[20],"population":[21],"individual":[23,39],"regarded":[25],"as":[26],"triangulation":[28,59],"point.":[31],"Hence":[32],"vertex":[34],"label":[35],"information":[36],"simplex":[40],"would":[41],"guide":[42],"algorithm":[44,77,103],"to":[45,94],"optimization":[47],"researching":[48],"and":[49,60,81,98,115,123],"judgment":[51],"which":[52],"could":[53],"be":[54,79,87],"calculated":[55],"with":[56,118],"hJ1":[58],"integer":[61],"label.":[62],"When":[63],"loading":[65],"simplexes":[66],"individuals":[68],"are":[69,92],"transferred":[70],"completely":[73],"labeled":[74],"simplexes,":[75],"will":[78,86],"terminated":[80],"global":[83],"optimal":[84],"solution":[85],"got.":[88],"Finally,":[89],"some":[90],"functions":[91],"used":[93],"demonstrate":[95],"effectiveness":[97],"strong":[99],"stability":[100],"through":[104],"solving":[105],"minimum":[107],"points":[108],"distinguished":[109],"by":[110],"using":[111],"Hessian":[113],"Matrix":[114],"then":[116],"compared":[117],"algorithms":[122],"J1":[124],"triangulation.":[125]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}