{"id":"https://openalex.org/W1993826930","doi":"https://doi.org/10.1109/cec.2012.6256631","title":"Discrete particle swarm optimization for materials acquisition in multi-unit libraries","display_name":"Discrete particle swarm optimization for materials acquisition in multi-unit libraries","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W1993826930","doi":"https://doi.org/10.1109/cec.2012.6256631","mag":"1993826930"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1266217","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101814375","display_name":"Yi-Ling Wu","orcid":"https://orcid.org/0000-0002-0389-1019"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yi-Ling Wu","raw_affiliation_strings":["Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan","Inst. of Inf. Manage., Nat. Chiao Tung Univ., Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Inst. of Inf. Manage., Nat. Chiao Tung Univ., Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065565451","display_name":"Tsu-Feng Ho","orcid":null},"institutions":[{"id":"https://openalex.org/I192703390","display_name":"Ming Chuan University","ror":"https://ror.org/02pgvzy25","country_code":"TW","type":"education","lineage":["https://openalex.org/I192703390"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tsu-Feng Ho","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Ming Chuan University, Taoyuan, Taiwan","Department of Computer Science and Information Engineering Ming Chuan University Taoyuan Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Ming Chuan University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I192703390"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering Ming Chuan University Taoyuan Taiwan","institution_ids":["https://openalex.org/I192703390"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047522660","display_name":"Shyong Jian Shyu","orcid":"https://orcid.org/0000-0003-1372-7076"},"institutions":[{"id":"https://openalex.org/I192703390","display_name":"Ming Chuan University","ror":"https://ror.org/02pgvzy25","country_code":"TW","type":"education","lineage":["https://openalex.org/I192703390"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shyong Jian Shyu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, Ming Chuan University, Taoyuan, Taiwan","Department of Computer Science and Information Engineering Ming Chuan University Taoyuan Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, Ming Chuan University, Taoyuan, Taiwan","institution_ids":["https://openalex.org/I192703390"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering Ming Chuan University Taoyuan Taiwan","institution_ids":["https://openalex.org/I192703390"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053249974","display_name":"Bertrand M.T. Lin","orcid":"https://orcid.org/0000-0003-0456-296X"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Bertrand M.T. Lin","raw_affiliation_strings":["Department of Finance and Information Management, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan","Dept. of Finance & Inf. Manage., Nat. Chiao Tung Univ., Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Finance and Information Management, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]},{"raw_affiliation_string":"Dept. of Finance & Inf. Manage., Nat. Chiao Tung Univ., Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6943,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.74992022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9990000128746033,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9975000023841858,"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/T12288","display_name":"Optimization and Search Problems","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8618494272232056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.660651683807373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6164752840995789},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.5906092524528503},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5319020748138428},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.49671512842178345},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.48858627676963806},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.46178677678108215},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.45662200450897217},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.44952598214149475},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42030584812164307},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2958776354789734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19723659753799438},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.08711206912994385}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8618494272232056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.660651683807373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6164752840995789},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5906092524528503},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5319020748138428},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.49671512842178345},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.48858627676963806},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.46178677678108215},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.45662200450897217},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.44952598214149475},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42030584812164307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2958776354789734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19723659753799438},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.08711206912994385},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2012.6256631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:1266217","is_oa":true,"landing_page_url":"https://zenodo.org/record/1266217","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1266217","is_oa":true,"landing_page_url":"https://zenodo.org/record/1266217","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5299999713897705,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W213287778","https://openalex.org/W1875348914","https://openalex.org/W1973494611","https://openalex.org/W1974691702","https://openalex.org/W1991805259","https://openalex.org/W2011039300","https://openalex.org/W2021858414","https://openalex.org/W2022117356","https://openalex.org/W2029229628","https://openalex.org/W2041372249","https://openalex.org/W2052115917","https://openalex.org/W2052736870","https://openalex.org/W2066484523","https://openalex.org/W2073981478","https://openalex.org/W2079787945","https://openalex.org/W2122496544","https://openalex.org/W2125213524","https://openalex.org/W2136104244","https://openalex.org/W2152195021"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1607218372","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768"],"abstract_inverted_index":{"With":[0],"limited":[1],"budget":[2],"and":[3,75,111],"inflation":[4],"rate,":[5],"the":[6,19,35,56,61,89,108,114],"materials":[7,22,62],"acquisition":[8,23,63],"in":[9,65,81],"multi-unit":[10,25,66],"libraries":[11,26,67],"has":[12],"been":[13],"a":[14,31],"challenging":[15],"issue":[16],"all":[17],"over":[18],"world.":[20],"The":[21],"for":[24,87],"can":[27,50,106],"be":[28,42,51],"regarded":[29],"as":[30,70],"generalized":[32],"version":[33],"of":[34],"knapsack":[36],"problem,":[37],"which":[38],"was":[39],"known":[40],"to":[41,54],"NP-hard,":[43],"with":[44],"much":[45],"more":[46,118],"constraints.":[47],"Thus,":[48],"it":[49],"computationally":[52],"expensive":[53],"solve":[55,107],"problem.":[57],"In":[58],"this":[59],"paper,":[60],"problem":[64,109],"is":[68,96],"formulated":[69],"an":[71],"integer":[72],"programming":[73],"model,":[74],"two":[76],"different":[77],"constraint-handling":[78,104],"mechanisms":[79],"applied":[80],"discrete":[82],"particle":[83],"swarm":[84],"optimization":[85],"algorithm":[86],"obtaining":[88],"near":[90],"optimal":[91],"solution":[92],"are":[93],"presented.":[94],"It":[95],"evident":[97],"from":[98],"our":[99],"computational":[100],"results":[101],"that":[102],"one":[103,116],"mechanism":[105],"effectively":[110],"efficiently,":[112],"while":[113],"other":[115],"takes":[117],"time.":[119]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}