{"id":"https://openalex.org/W1991269382","doi":"https://doi.org/10.4304/jcp.6.6.1175-1182","title":"Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem","display_name":"Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem","publication_year":2011,"publication_date":"2011-06-03","ids":{"openalex":"https://openalex.org/W1991269382","doi":"https://doi.org/10.4304/jcp.6.6.1175-1182","mag":"1991269382"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.6.6.1175-1182","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.6.1175-1182","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/A5101665677","display_name":"Qin Jin","orcid":"https://orcid.org/0000-0003-4163-6067"},"institutions":[{"id":"https://openalex.org/I178232147","display_name":"Guizhou University","ror":"https://ror.org/02wmsc916","country_code":"CN","type":"education","lineage":["https://openalex.org/I178232147"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jin Qin","raw_affiliation_strings":["Guizhou University"],"affiliations":[{"raw_affiliation_string":"Guizhou University","institution_ids":["https://openalex.org/I178232147"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101512101","display_name":"Yixin Yin","orcid":"https://orcid.org/0000-0001-6056-8878"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yi-xin Yin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5000265767","display_name":"Xiao-juan Ban","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao-juan Ban","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101665677"],"corresponding_institution_ids":["https://openalex.org/I178232147"],"apc_list":null,"apc_paid":null,"fwci":1.56833291,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.84411405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"6","issue":"6","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9962999820709229,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9031000137329102,"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/graph-coloring","display_name":"Graph coloring","score":0.6577233076095581},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.6128940582275391},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49060240387916565},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.46912550926208496},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.46382394433021545},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.44287392497062683},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.4181844890117645},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.41211074590682983},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3842235207557678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3655473589897156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3332851231098175},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2829635739326477},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2249460518360138},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15758919715881348},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08985242247581482}],"concepts":[{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6577233076095581},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.6128940582275391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49060240387916565},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.46912550926208496},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.46382394433021545},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.44287392497062683},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.4181844890117645},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.41211074590682983},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3842235207557678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3655473589897156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3332851231098175},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2829635739326477},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2249460518360138},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15758919715881348},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08985242247581482}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.6.6.1175-1182","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.6.6.1175-1182","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W202510507","https://openalex.org/W1576426930","https://openalex.org/W1582334898","https://openalex.org/W1971493157","https://openalex.org/W1974340898","https://openalex.org/W1994445384","https://openalex.org/W1996134775","https://openalex.org/W2004617458","https://openalex.org/W2011039300","https://openalex.org/W2021735068","https://openalex.org/W2039568841","https://openalex.org/W2055440347","https://openalex.org/W2064744005","https://openalex.org/W2093938881","https://openalex.org/W2111012509","https://openalex.org/W2125213524","https://openalex.org/W2153638045","https://openalex.org/W2167036627","https://openalex.org/W2168000780","https://openalex.org/W2324827308","https://openalex.org/W2402846924","https://openalex.org/W2467020497","https://openalex.org/W2476096155","https://openalex.org/W2543580944","https://openalex.org/W4239749705","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W4297911588","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W2793500002","https://openalex.org/W2046652778","https://openalex.org/W2380525562","https://openalex.org/W2385428710","https://openalex.org/W4229747356"],"abstract_inverted_index":{"Graph":[0],"coloring":[1,27,53,136,179],"problem":[2,137,180],"(GCP)":[3],"is":[4,14,99,125,163,183,203],"one":[5],"of":[6,77,93,104,115,117,157,198,231],"the":[7,73,106,113,139,147,199,209],"most":[8],"studied":[9],"combinatorial":[10],"optimization":[11,50,59],"problems.":[12],"It":[13],"important":[15],"in":[16],"theory":[17],"and":[18,32],"practice.":[19],"There":[20],"have":[21],"been":[22],"many":[23],"algorithms":[24,31,234],"for":[25,64,177],"graph":[26,52,135,178],"problem,":[28,72],"including":[29],"exact":[30],"(meta-)heuristic":[33],"algorithms.":[34],"In":[35,129],"this":[36,102],"paper,":[37],"we":[38],"attempt":[39],"another":[40],"meta-heuristic":[41],"method":[42],"\u00be":[45,153],"particle":[48],"swarm":[49,58],"to":[51,70,81,133,145],"problem.":[54,66],"Particle":[57],"(PSO)":[60],"was":[61],"originally":[62],"developed":[63],"continuous":[65],"To":[67],"apply":[68],"PSO":[69,78,107,123,141,149,175],"discrete":[71,85,96,122,140,174],"standard":[74],"arithmetic":[75],"operators":[76,108],"are":[79,109,227],"required":[80],"be":[82],"redefined":[83],"over":[84,95],"space.":[86],"A":[89],"conception":[92],"distance":[94],"solution":[97],"space":[98],"introduced.":[100],"Under":[101],"notion":[103],"distance,":[105],"redefined.":[110],"After":[111],"reinterpreting":[112],"composition":[114],"velocity":[116],"a":[118,120,172,193],"particle,":[119],"general":[121],"algorithm":[124,144,176,202],"proposed.":[126],"order":[130],"solve":[134],"by":[138,191],"algorithm,":[142],"an":[143],"implement":[146],"crucial":[148],"operator":[150],"difference":[156],"two":[158],"positions":[159],"(solutions)":[162],"design":[166],"ed":[168],".":[170,236],"Then,":[171],"hybrid":[173,201],"propose":[186],"d":[188],"combining":[192],"local":[194],"search.":[195],"Empirical":[196],"study":[197],"proposed":[200],"also":[204],"carried":[205],"out":[206],"based":[207],"on":[208],"second":[212],"DIMACS":[215],"challenge":[218],"benchmarks.":[221],"The":[222],"experimental":[223],"results":[224],"competitive":[228],"with":[229],"that":[230],"other":[232],"well-known":[233]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}