{"id":"https://openalex.org/W1187727001","doi":"https://doi.org/10.4018/ijamc.2015100101","title":"An OR Practitioner's Solution Approach for the Set Covering Problem","display_name":"An OR Practitioner's Solution Approach for the Set Covering Problem","publication_year":2015,"publication_date":"2015-06-29","ids":{"openalex":"https://openalex.org/W1187727001","doi":"https://doi.org/10.4018/ijamc.2015100101","mag":"1187727001"},"language":"en","primary_location":{"id":"doi:10.4018/ijamc.2015100101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2015100101","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/A5024008818","display_name":"Yun Lu","orcid":"https://orcid.org/0000-0003-2296-425X"},"institutions":[{"id":"https://openalex.org/I2132711","display_name":"Kutztown University","ror":"https://ror.org/056veft20","country_code":"US","type":"education","lineage":["https://openalex.org/I2132711"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yun Lu","raw_affiliation_strings":["Department of Mathematics, Kutztown University, Kutztown, PA, USA","Department of Mathematics, Kutztown University, Kutztown, PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kutztown University, Kutztown, PA, USA","institution_ids":["https://openalex.org/I2132711"]},{"raw_affiliation_string":"Department of Mathematics, Kutztown University, Kutztown, PA, USA#TAB#","institution_ids":["https://openalex.org/I2132711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014061236","display_name":"Francis J. Vasko","orcid":"https://orcid.org/0000-0001-8975-0999"},"institutions":[{"id":"https://openalex.org/I2132711","display_name":"Kutztown University","ror":"https://ror.org/056veft20","country_code":"US","type":"education","lineage":["https://openalex.org/I2132711"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francis J. Vasko","raw_affiliation_strings":["Department of Mathematics, Kutztown University, Kutztown, PA, USA","Department of Mathematics, Kutztown University, Kutztown, PA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Kutztown University, Kutztown, PA, USA","institution_ids":["https://openalex.org/I2132711"]},{"raw_affiliation_string":"Department of Mathematics, Kutztown University, Kutztown, PA, USA#TAB#","institution_ids":["https://openalex.org/I2132711"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024008818"],"corresponding_institution_ids":["https://openalex.org/I2132711"],"apc_list":null,"apc_paid":null,"fwci":5.1773,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.95455351,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"4","first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9861999750137329,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9787999987602234,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.8794656991958618},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6951482892036438},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6414927244186401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6151688694953918},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5618907809257507},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5543017983436584},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.471142441034317},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4375927746295929},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24034655094146729}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8794656991958618},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6951482892036438},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6414927244186401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6151688694953918},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5618907809257507},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5543017983436584},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.471142441034317},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4375927746295929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24034655094146729},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijamc.2015100101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijamc.2015100101","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:6:y:2015:i:4:p:1-13","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2015100101","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1573881838","https://openalex.org/W1750082253","https://openalex.org/W1964214534","https://openalex.org/W1964312519","https://openalex.org/W1973727721","https://openalex.org/W1999284878","https://openalex.org/W2001422417","https://openalex.org/W2016207616","https://openalex.org/W2021490042","https://openalex.org/W2023444198","https://openalex.org/W2023702796","https://openalex.org/W2049755739","https://openalex.org/W2049967755","https://openalex.org/W2066650517","https://openalex.org/W2076570464","https://openalex.org/W2086958842","https://openalex.org/W2094252454","https://openalex.org/W2099813847","https://openalex.org/W2146957093","https://openalex.org/W2152178978","https://openalex.org/W3125132395","https://openalex.org/W3149604617"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W3119129187","https://openalex.org/W2787412873"],"abstract_inverted_index":{"The":[0,186],"set":[1,165],"covering":[2,166],"problem":[3,8],"(SCP)":[4],"is":[5,191],"an":[6,120],"NP-complete":[7],"that":[9],"has":[10],"many":[11],"important":[12],"industrial":[13,16],"applications.":[14],"Since":[15],"applications":[17],"are":[18,26,57],"typically":[19,82],"large":[20],"in":[21,54,178],"scale,":[22],"exact":[23],"solution":[24,107,181],"algorithms":[25],"not":[27,58,84],"feasible":[28],"for":[29,50,109,157,195],"operations":[30],"research":[31],"(OR)":[32],"practitioners":[33],"to":[34,39,61,104,118,131,188,198],"use":[35],"when":[36],"called":[37],"on":[38,143],"solve":[40],"real-world":[41],"problems":[42,167],"involving":[43],"SCPs.":[44],"However,":[45],"the":[46,51,55,68,90,97,110,133,172,196],"best":[47],"performing":[48],"heuristics":[49,65,81],"SCP":[52],"reported":[53],"literature":[56],"usually":[59,66],"straightforward":[60,103],"implement.":[62,199],"Additionally,":[63],"these":[64],"require":[67],"fine-tuning":[69],"of":[70,174,180],"several":[71],"parameters.":[72],"In":[73,94],"contrast,":[74],"simple":[75],"greedy":[76,80,116],"or":[77],"even":[78],"randomized":[79,115],"do":[83],"give":[85],"as":[86,89],"good":[87],"results":[88,163],"more":[91],"sophisticated":[92],"heuristics.":[93],"this":[95,175,189],"paper,":[96],"authors":[98],"present":[99],"a":[100,102,114,126,144],"compromise;":[101],"implement,":[105],"population-based":[106],"approach":[108,117,130,138,148,176,190],"SCP.":[111],"It":[112],"uses":[113,125,139],"generate":[119],"initial":[121],"population":[122,134],"and":[123,153,183],"then":[124],"genetic-based":[127],"two":[128],"phase":[129],"improve":[132],"solutions.":[135],"This":[136],"two-phase":[137],"transformation":[140],"equations":[141],"based":[142,146],"Teaching-Learning":[145],"optimization":[147,160],"developed":[149],"by":[150],"Rao,":[151],"Savsani":[152],"Vakharia":[154],"(2011,":[155],"2012)":[156],"continuous":[158],"nonlinear":[159],"problems.":[161],"Empirical":[162],"using":[164],"from":[168],"Beasley's":[169],"OR-library":[170],"demonstrate":[171],"competitiveness":[173],"both":[177],"terms":[179],"quality":[182],"execution":[184],"time.":[185],"advantage":[187],"its":[192],"relative":[193],"simplicity":[194],"practitioner":[197]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}