{"id":"https://openalex.org/W1495478750","doi":"https://doi.org/10.1109/cec.2005.1554669","title":"Linear Equality Constraints and Homomorphous Mappings in PSO","display_name":"Linear Equality Constraints and Homomorphous Mappings in PSO","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W1495478750","doi":"https://doi.org/10.1109/cec.2005.1554669","mag":"1495478750"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554669","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5110886409","display_name":"Christopher K. Monson","orcid":null},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C.K. Monson","raw_affiliation_strings":["Computer Science Department, Brigham Young University, UK","[Dept. of Comput. Sci., Brigham Young Univ., Provo, UT]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, UK","institution_ids":[]},{"raw_affiliation_string":"[Dept. of Comput. Sci., Brigham Young Univ., Provo, UT]","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029074659","display_name":"Kevin Seppi","orcid":"https://orcid.org/0000-0002-4932-2700"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K.D. Seppi","raw_affiliation_strings":["Computer Science Department, Brigham Young University, UK","[Dept. of Comput. Sci., Brigham Young Univ., Provo, UT]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, UK","institution_ids":[]},{"raw_affiliation_string":"[Dept. of Comput. Sci., Brigham Young Univ., Provo, UT]","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"73","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9811999797821045,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9761000275611877,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7012199759483337},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.576126754283905},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.534442126750946},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5284519195556641},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5178244709968567},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.49560558795928955},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47471749782562256},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.45572417974472046},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.43373411893844604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37802648544311523},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15655654668807983}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7012199759483337},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.576126754283905},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.534442126750946},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5284519195556641},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5178244709968567},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.49560558795928955},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47471749782562256},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.45572417974472046},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.43373411893844604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37802648544311523},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15655654668807983},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/cec.2005.1554669","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554669","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.905.5480","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.905.5480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"http://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article%3D2003%26context%3Dfacpub","raw_type":"text"},{"id":"pmh:oai:scholarsarchive.byu.edu:facpub-2003","is_oa":false,"landing_page_url":"https://scholarsarchive.byu.edu/facpub/1004","pdf_url":null,"source":{"id":"https://openalex.org/S4377196308","display_name":"ScholarsArchive  (Brigham Young University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I100005738","host_organization_name":"Brigham Young University","host_organization_lineage":["https://openalex.org/I100005738"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.59.8924","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.8924","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.bouncingchairs.net/linconstrainedpso.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.75.1055","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.75.1055","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.bouncingchairs.net/linconstrainedpso.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":16,"referenced_works":["https://openalex.org/W131206777","https://openalex.org/W148552177","https://openalex.org/W1683021915","https://openalex.org/W1901313535","https://openalex.org/W1930801851","https://openalex.org/W2038659300","https://openalex.org/W2109636032","https://openalex.org/W2124635773","https://openalex.org/W2127931254","https://openalex.org/W2139339670","https://openalex.org/W2142183404","https://openalex.org/W2152195021","https://openalex.org/W2169245194","https://openalex.org/W4301173492","https://openalex.org/W6605347767","https://openalex.org/W6605980648"],"related_works":["https://openalex.org/W2355999325","https://openalex.org/W2474851184","https://openalex.org/W3123416417","https://openalex.org/W2145128058","https://openalex.org/W2357354566","https://openalex.org/W23263483","https://openalex.org/W2000609527","https://openalex.org/W2013387628","https://openalex.org/W2170850735","https://openalex.org/W78752106"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,39,75],"homomorphous":[3],"mapping":[4,81],"that":[5,48,77],"converts":[6],"problems":[7,17],"with":[8,20,26,41],"linear":[9,42,98],"equality":[10,43,99],"constraints":[11,100],"into":[12],"fully":[13],"unconstrained":[14,32],"and":[15,54,90],"lower-dimensional":[16],"for":[18,62],"optimization":[19,33],"PSO.":[21],"This":[22],"approach,":[23],"in":[24,101],"contrast":[25],"feasibility":[27],"preservation":[28],"methods,":[29],"allows":[30],"any":[31],"algorithm":[34],"to":[35,38,51,74,86,96],"be":[36,52,87],"applied":[37],"problem":[40,76],"constraints,":[44],"making":[45],"available":[46],"tools":[47],"are":[49],"known":[50],"effective":[53,89],"simplifying":[55],"the":[56,80],"process":[57],"of":[58,65,70],"choosing":[59],"an":[60],"optimizer":[61],"these":[63],"kinds":[64],"constrained":[66],"problems.":[67],"The":[68],"application":[69],"some":[71],"PSO":[72,102],"algorithms":[73],"has":[78],"undergone":[79],"presented":[82],"here":[83],"is":[84],"shown":[85],"more":[88,91],"consistent":[92],"than":[93],"other":[94],"approaches":[95],"handling":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}