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.1109/BICTA.2010.5645102
{"id":"https://openalex.org/W2041012792","doi":"https://doi.org/10.1109/bicta.2010.5645102","title":"A novel Ant algorithm for permutation flow shop problem","display_name":"A novel Ant algorithm for permutation flow shop problem","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2041012792","doi":"https://doi.org/10.1109/bicta.2010.5645102","mag":"2041012792"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/bicta.2010.5645102","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5089810658","display_name":"Wenjin Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"None Wenjin Yang","raw_affiliation_strings":["Department of Computer Science,Hunan University, Changsha 410082,China)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,Hunan University, Changsha 410082,China)","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102144971","display_name":"Yantao Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"None Yantao Zhou","raw_affiliation_strings":["Department of Computer Science,Hunan University, Changsha 410082,China)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,Hunan University, Changsha 410082,China)","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078793726","display_name":"Kenli Li","orcid":"https://orcid.org/0000-0002-2635-7716"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"None Kenli Li","raw_affiliation_strings":["Department of Computer Science,Hunan University, Changsha 410082,China)"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,Hunan University, Changsha 410082,China)","institution_ids":["https://openalex.org/I16609230"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.87,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.395707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":64,"max":71},"biblio":{"volume":null,"issue":null,"first_page":"1093","last_page":"1097"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998,"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.9969,"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 and Packing Problems","score":0.9876,"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/sequence","display_name":"Sequence (biology)","score":0.52717125},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.41364348}],"concepts":[{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.8244741},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.65643674},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6207844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6156384},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.59902686},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.52717125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.52662164},{"id":"https://openalex.org/C97467695","wikidata":"https://www.wikidata.org/wiki/Q295802","display_name":"ANT","level":2,"score":0.49959874},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4476501},{"id":"https://openalex.org/C200985842","wikidata":"https://www.wikidata.org/wiki/Q3375503","display_name":"Random permutation","level":3,"score":0.44152814},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.41364348},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3670826},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.363684},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22549674},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.17361963},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.14151946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10548189},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/bicta.2010.5645102","pdf_url":null,"source":null,"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":10,"referenced_works":["https://openalex.org/W1986945669","https://openalex.org/W1992350316","https://openalex.org/W1997363303","https://openalex.org/W2001664299","https://openalex.org/W2008665401","https://openalex.org/W2069824896","https://openalex.org/W2154929945","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W4292083457"],"related_works":["https://openalex.org/W4399062323","https://openalex.org/W4237535716","https://openalex.org/W2388326823","https://openalex.org/W2381829748","https://openalex.org/W2366876790","https://openalex.org/W2347951034","https://openalex.org/W2244460820","https://openalex.org/W2110363036","https://openalex.org/W2109336245","https://openalex.org/W2071981049"],"abstract_inverted_index":{"A":[0],"new":[1,15,50],"ant":[2,28],"algorithm":[3],"for":[4],"the":[5,54,68],"permutation":[6],"flow":[7],"shop":[8],"problem":[9],"is":[10,18,29,48,71],"presented,":[11],"which":[12,26],"embraces":[13],"two":[14],"features.":[16],"One":[17],"a":[19,42,49,59],"different":[20],"yet":[21],"outstanding":[22],"pheromone":[23],"structure,":[24],"in":[25],"an":[27],"permitted":[30],"to":[31,52],"select":[32],"more":[33],"than":[34],"one":[35],"jobs":[36],"at":[37],"each":[38],"step":[39],"when":[40],"constructing":[41],"complete":[43],"travel":[44],"sequence.":[45],"The":[46],"other":[47],"heuristic":[51],"guide":[53],"search.":[55],"Experiments":[56],"shows":[57],"that":[58],"considerable":[60],"improvement":[61],"of":[62],"performance":[63],"can":[64],"be":[65],"obtained,":[66],"and":[67],"reason":[69],"behind":[70],"presented.":[72]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2041012792","counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2024-12-07T20:08:12.634083","created_date":"2016-06-24"}