{"id":"https://openalex.org/W2091538699","doi":"https://doi.org/10.4018/jamc.2011100104","title":"A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem","display_name":"A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2091538699","doi":"https://doi.org/10.4018/jamc.2011100104","mag":"2091538699"},"language":"en","primary_location":{"id":"doi:10.4018/jamc.2011100104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2011100104","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","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/A5083258901","display_name":"Rahul Roy","orcid":"https://orcid.org/0000-0002-4026-1307"},"institutions":[{"id":"https://openalex.org/I67357951","display_name":"KIIT University","ror":"https://ror.org/00k8zt527","country_code":"IN","type":"education","lineage":["https://openalex.org/I67357951"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Rahul Roy","raw_affiliation_strings":["KIIT University, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KIIT University, India","institution_ids":["https://openalex.org/I67357951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001882647","display_name":"Satchidananda Dehuri","orcid":"https://orcid.org/0000-0003-1435-4531"},"institutions":[{"id":"https://openalex.org/I108526665","display_name":"Fakir Mohan University","ror":"https://ror.org/00g0n6t22","country_code":"IN","type":"education","lineage":["https://openalex.org/I108526665"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Satchidananda Dehuri","raw_affiliation_strings":["Fakir Mohan University, India"],"raw_orcid":"https://orcid.org/0000-0003-1435-4531","affiliations":[{"raw_affiliation_string":"Fakir Mohan University, India","institution_ids":["https://openalex.org/I108526665"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108081550","display_name":"Sung\u2010Bae Cho","orcid":"https://orcid.org/0000-0002-7027-2429"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sung Bae Cho","raw_affiliation_strings":["Yonsei University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yonsei University, South Korea","institution_ids":["https://openalex.org/I193775966"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.8288,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.93715558,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"2","issue":"4","first_page":"41","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.978600025177002,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8487305641174316},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7141386270523071},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6571683287620544},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.6417197585105896},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5840309262275696},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.5602051615715027},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5142709612846375},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.48818856477737427},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"Discrete optimization","score":0.47006067633628845},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.45690786838531494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4505055248737335},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.44502684473991394},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.436614990234375},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.42818483710289},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4089474081993103}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8487305641174316},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7141386270523071},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6571683287620544},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.6417197585105896},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5840309262275696},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.5602051615715027},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5142709612846375},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.48818856477737427},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.47006067633628845},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.45690786838531494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4505055248737335},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.44502684473991394},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.436614990234375},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.42818483710289},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4089474081993103},{"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.4018/jamc.2011100104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jamc.2011100104","pdf_url":null,"source":{"id":"https://openalex.org/S7509020","display_name":"International Journal of Applied Metaheuristic Computing","issn_l":"1947-8283","issn":["1947-8283","1947-8291"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Applied Metaheuristic Computing","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jamc00:v:2:y:2011:i:4:p:41-57","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2011100104","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.800000011920929,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W145413376","https://openalex.org/W1637451315","https://openalex.org/W1690614984","https://openalex.org/W1985909617","https://openalex.org/W2011039300","https://openalex.org/W2060735344","https://openalex.org/W2066671865","https://openalex.org/W2070131199","https://openalex.org/W2123808725","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2140882991","https://openalex.org/W2155345556","https://openalex.org/W2476096155","https://openalex.org/W2680430326"],"related_works":["https://openalex.org/W4375949242","https://openalex.org/W86240527","https://openalex.org/W2322270513","https://openalex.org/W1983027319","https://openalex.org/W2580862641","https://openalex.org/W4381955737","https://openalex.org/W2378868429","https://openalex.org/W2069901459","https://openalex.org/W3154887145","https://openalex.org/W4298394020"],"abstract_inverted_index":{"The":[0,129,153],"Combinatorial":[1],"problems":[2,18,43,147],"are":[3,57],"real":[4],"world":[5],"decision":[6,16],"making":[7,17],"problem":[8,32],"with":[9,136],"discrete":[10,90,127,146],"and":[11,25,89,100,106,123,142,148],"disjunctive":[12],"choices.":[13],"When":[14],"these":[15],"involve":[19],"more":[20],"than":[21],"one":[22],"conflicting":[23],"objective":[24],"constraint,":[26],"it":[27,102,125],"turns":[28],"the":[29,36,87,104,132,157],"polynomial":[30],"time":[31],"into":[33],"NP-hard.":[34],"Thus,":[35],"straight":[37],"forward":[38],"approaches":[39,56],"to":[40,73,85,96,114,126],"solve":[41,74],"multi-objective":[42,75,149],"would":[44],"not":[45],"give":[46],"an":[47],"optimal":[48],"solution.":[49],"In":[50,60],"such":[51],"case":[52],"evolutionary":[53,138],"based":[54,68],"meta-heuristic":[55,69],"found":[58],"suitable.":[59],"this":[61],"paper,":[62],"a":[63,80,97],"novel":[64],"particle":[65,111,162],"swarm":[66,112,163],"optimization":[67,77,113,164],"algorithm":[70,133],"is":[71,83,134],"presented":[72],"combinatorial":[76,161],"problems.":[78],"Here":[79],"mapping":[81],"method":[82],"considered":[84],"convert":[86],"binary":[88],"values":[91],"(solution":[92],"encoded":[93],"as":[94],"particles)":[95],"continuous":[98,121],"domain":[99,122],"update":[101,108],"using":[103],"velocity":[105],"position":[107],"equation":[109],"of":[110,118,131,160],"find":[115],"new":[116],"set":[117],"solutions":[119],"in":[120],"demap":[124],"values.":[128],"performance":[130,159],"compared":[135],"other":[137],"strategy":[139],"like":[140],"SPEA":[141],"NSGA-II":[143],"on":[144],"pseudo-Boolean":[145],"0/1":[150],"knapsack":[151],"problem.":[152],"experimental":[154],"results":[155],"confirmed":[156],"better":[158],"algorithm.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T06:19:23.411458","created_date":"2025-10-10T00:00:00"}