{"id":"https://openalex.org/W1999032546","doi":"https://doi.org/10.1109/emeit.2011.6023640","title":"Ant colony algorithm for a class of non-differentiable optimization problems","display_name":"Ant colony algorithm for a class of non-differentiable optimization problems","publication_year":2011,"publication_date":"2011-08-01","ids":{"openalex":"https://openalex.org/W1999032546","doi":"https://doi.org/10.1109/emeit.2011.6023640","mag":"1999032546"},"language":"en","primary_location":{"id":"doi:10.1109/emeit.2011.6023640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emeit.2011.6023640","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology","raw_type":"proceedings-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/A5104183792","display_name":"Jiajia He","orcid":"https://orcid.org/0000-0003-0073-7689"},"institutions":[{"id":"https://openalex.org/I51622183","display_name":"Shaanxi University of Science and Technology","ror":"https://ror.org/034t3zs45","country_code":"CN","type":"education","lineage":["https://openalex.org/I51622183"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiajia He","raw_affiliation_strings":["College of Electrical and Information Engineering, Shaanxi University of Science and Technology, Xi'an, P. R. China","College of Electrical and Information Engineering Shaanxi University of Science and Technology Xi'an 710021 P. R. China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Shaanxi University of Science and Technology, Xi'an, P. R. China","institution_ids":["https://openalex.org/I51622183"]},{"raw_affiliation_string":"College of Electrical and Information Engineering Shaanxi University of Science and Technology Xi'an 710021 P. R. China","institution_ids":["https://openalex.org/I51622183"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013252770","display_name":"Zai-En Hou","orcid":null},"institutions":[{"id":"https://openalex.org/I51622183","display_name":"Shaanxi University of Science and Technology","ror":"https://ror.org/034t3zs45","country_code":"CN","type":"education","lineage":["https://openalex.org/I51622183"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zai-en Hou","raw_affiliation_strings":["College of Electrical and Information Engineering, Shaanxi University of Science and Technology, Xi'an, P. R. China","College of science, Shaanxi University of Science and Technolog, Xi'an 710021, P. R. China"],"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Shaanxi University of Science and Technology, Xi'an, P. R. China","institution_ids":["https://openalex.org/I51622183"]},{"raw_affiliation_string":"College of science, Shaanxi University of Science and Technolog, Xi'an 710021, P. R. China","institution_ids":["https://openalex.org/I51622183"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104183792"],"corresponding_institution_ids":["https://openalex.org/I51622183"],"apc_list":null,"apc_paid":null,"fwci":0.7555,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.75796253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"34","issue":null,"first_page":"2644","last_page":"2647"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980999827384949,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958999752998352,"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/differentiable-function","display_name":"Differentiable function","score":0.8343464136123657},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.768272876739502},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.641785740852356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5393253564834595},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5392597317695618},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5295031070709229},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.515012264251709},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.451285183429718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43768996000289917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3237854838371277},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15318620204925537}],"concepts":[{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.8343464136123657},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.768272876739502},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.641785740852356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5393253564834595},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5392597317695618},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5295031070709229},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.515012264251709},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.451285183429718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43768996000289917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3237854838371277},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15318620204925537},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/emeit.2011.6023640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emeit.2011.6023640","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335227","display_name":"Bijzonder Onderzoeksfonds UGent","ror":"https://ror.org/00cv9y106"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1602076081","https://openalex.org/W1987784330","https://openalex.org/W2021009197","https://openalex.org/W2366139690","https://openalex.org/W2367790330","https://openalex.org/W2373577270","https://openalex.org/W2393006548"],"related_works":["https://openalex.org/W4285277090","https://openalex.org/W4327738859","https://openalex.org/W2727311809","https://openalex.org/W2730284527","https://openalex.org/W4312509357","https://openalex.org/W3123416417","https://openalex.org/W2013038594","https://openalex.org/W23263483","https://openalex.org/W1599844062","https://openalex.org/W2350700808"],"abstract_inverted_index":{"There":[0],"are":[1,13,39],"many":[2],"methods":[3],"for":[4],"solving":[5],"non-differentiable":[6,28],"optimization":[7,29,34],"problems,":[8],"but":[9],"most":[10],"of":[11,46],"them":[12],"too":[14],"difficult":[15],"to":[16,26,31,64],"realize.":[17],"In":[18],"this":[19],"paper,":[20],"penalty":[21],"function":[22],"method":[23],"is":[24],"adopted":[25],"transform":[27],"problems":[30],"unconstrained":[32],"differentiable":[33],"problems.":[35],"Then,":[36],"computational":[37],"experiments":[38],"conducted":[40],"based":[41],"on":[42],"the":[43],"uncertainty":[44],"analysis":[45],"ant":[47],"colony":[48],"algorithm":[49],"(ACA).":[50],"Numerical":[51],"results":[52],"show":[53],"that":[54],"ACA":[55],"can":[56],"make":[57],"such":[58],"a":[59],"problem":[60],"simple":[61],"and":[62],"easy":[63],"calculate.":[65]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}