iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.openalex.org/works/doi:10.1504/IJCAT.2012.049080
{"id":"https://openalex.org/W2123018383","doi":"https://doi.org/10.1504/ijcat.2012.049080","title":"An evolutionary linear programming algorithm for solving the stock reduction problem","display_name":"An evolutionary linear programming algorithm for solving the stock reduction problem","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2123018383","doi":"https://doi.org/10.1504/ijcat.2012.049080","mag":"2123018383"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcat.2012.049080","pdf_url":null,"source":{"id":"https://openalex.org/S4210207686","display_name":"International Journal of Computer Applications in Technology","issn_l":"0952-8091","issn":["0952-8091","1741-5047"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5101743038","display_name":"Gang Shen","orcid":"https://orcid.org/0000-0001-5961-8110"},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gang Shen","raw_affiliation_strings":["Computer Science Department, Georgia State University, P.O. Box 3994, Atlanta, GA 30302-3994, USA."],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Georgia State University, P.O. Box 3994, Atlanta, GA 30302-3994, USA.","institution_ids":["https://openalex.org/I181565077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102165868","display_name":"Yan Qing Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I181565077","display_name":"Georgia State University","ror":"https://ror.org/03qt6ba18","country_code":"US","type":"education","lineage":["https://openalex.org/I181565077"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yan Qing Zhang","raw_affiliation_strings":["Computer Science Department, Georgia State University, P.O. Box 3994, Atlanta, GA 30302-3994, USA."],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Georgia State University, P.O. Box 3994, Atlanta, GA 30302-3994, USA.","institution_ids":["https://openalex.org/I181565077"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.083,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":3,"citation_normalized_percentile":{"value":0.662378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":75,"max":78},"biblio":{"volume":"44","issue":"3","first_page":"171","last_page":"171"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Swarm Intelligence Optimization Algorithms","score":0.9992,"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":"Swarm Intelligence Optimization Algorithms","score":0.9992,"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 Problems in Manufacturing Systems","score":0.9985,"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/T12176","display_name":"Optimization of Cutting and Packing Problems","score":0.9984,"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/hybrid-optimization","display_name":"Hybrid Optimization","score":0.549844},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle Swarm Optimization","score":0.536987},{"id":"https://openalex.org/keywords/optimization-applications","display_name":"Optimization Applications","score":0.534571},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global Optimization","score":0.523629},{"id":"https://openalex.org/keywords/constraint-handling","display_name":"Constraint Handling","score":0.52048},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.41700184}],"concepts":[{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5943416},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.50411904},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.47680566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46202004},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44656187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44222668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4263503},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.41700184},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.36422905},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijcat.2012.049080","pdf_url":null,"source":{"id":"https://openalex.org/S4210207686","display_name":"International Journal of Computer Applications in Technology","issn_l":"0952-8091","issn":["0952-8091","1741-5047"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":40,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1506499706","https://openalex.org/W1569385172","https://openalex.org/W1659842140","https://openalex.org/W1982514949","https://openalex.org/W1991335163","https://openalex.org/W2002725779","https://openalex.org/W2002798134","https://openalex.org/W2017383894","https://openalex.org/W2035851984","https://openalex.org/W2037521805","https://openalex.org/W2037986657","https://openalex.org/W2058404589","https://openalex.org/W2079754721","https://openalex.org/W2087782700","https://openalex.org/W2089822361","https://openalex.org/W2095771532","https://openalex.org/W2097599209","https://openalex.org/W2104157986","https://openalex.org/W2112624407","https://openalex.org/W2113915527","https://openalex.org/W2116622951","https://openalex.org/W2122214908","https://openalex.org/W2123308648","https://openalex.org/W2123859700","https://openalex.org/W2130927504","https://openalex.org/W2131302168","https://openalex.org/W2134097647","https://openalex.org/W2136690355","https://openalex.org/W2141623730","https://openalex.org/W2142656462","https://openalex.org/W2143381319","https://openalex.org/W2144946856","https://openalex.org/W2152883126","https://openalex.org/W2154411958","https://openalex.org/W2156063987","https://openalex.org/W2165281693","https://openalex.org/W2166348281","https://openalex.org/W2166513470","https://openalex.org/W2546117144"],"related_works":["https://openalex.org/W4245568382","https://openalex.org/W4244994070","https://openalex.org/W4214624958","https://openalex.org/W4205348974","https://openalex.org/W3182682721","https://openalex.org/W2784100870","https://openalex.org/W2337360258","https://openalex.org/W2293098548","https://openalex.org/W2133667137","https://openalex.org/W2007464938"],"abstract_inverted_index":{"It":[0],"is":[1,43,55,66,74,84],"very":[2],"difficult":[3],"to":[4,39,45,57],"solve":[5,40,58,100],"complex":[6,101],"nested":[7,69],"optimisation":[8,70,123],"problems":[9,15,124],"(optimising":[10],"both":[11],"parent":[12,48,73],"and":[13,35,50,81,106,121],"child":[14,83],"at":[16],"the":[17,47,51,59,82],"same":[18],"time).":[19],"In":[20],"this":[21],"paper,":[22],"we":[23],"propose":[24],"an":[25],"evolutionary":[26],"linear":[27],"programming":[28],"algorithm":[29,54,98,111],"that":[30,94],"combines":[31],"Linear":[32],"Programming":[33],"(LP)":[34],"Genetic":[36],"Algorithm":[37],"(GA)":[38],"them.":[41],"GA":[42],"used":[44,56,114],"optimise":[46],"problem,":[49],"LP/GA":[52],"hybrid":[53,97,110],"sub\u2013problem.":[60],"The":[61,72],"stock":[62,77,87],"reduction":[63],"problem":[64,79,88],"(SRP)":[65],"a":[67,75,85],"typical":[68],"problem.":[71],"minimising":[76],"mix":[78],"(MSMP),":[80],"cutting":[86],"(CSP).":[89],"Simulation":[90],"results":[91],"have":[92],"shown":[93],"our":[95],"new":[96,109],"can":[99,112],"SRPs":[102],"with":[103,126],"high":[104],"efficiency":[105],"accuracy.":[107],"This":[108],"be":[113],"in":[115],"many":[116],"other":[117],"applications":[118],"where":[119],"integer":[120],"non\u2013integer":[122],"interact":[125],"each":[127],"other,":[128],"such":[129],"as":[130],"airline":[131],"scheduling,":[132,134],"shipping":[133],"etc.":[135]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2123018383","counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2024-11-27T22:59:58.704253","created_date":"2016-06-24"}