default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunzhi Li 0001
Person information
- affiliation: Peking University, School of Artificial Intelligence, Beijing, China
Other persons with the same name
- Junzhi Li — disambiguation page
- Junzhi Li 0002
![[0000-0001-7811-4575]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-7811-4575")
— Sun Yat-Sen University, School of Electronics and Communication Engineering, Guangzhou, China - Junzhi Li 0003 — Wuhan University of Science and Technology, Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c11]Junzhi Li, Ying Tan:
Information Utilization Ratio in Heuristic Optimization Algorithms. ICSI (1) 2022: 3-22- 2020
- [j5]Junzhi Li, Ying Tan:
A Comprehensive Review of the Fireworks Algorithm. ACM Comput. Surv. 52(6): 121:1-121:28 (2020)
2010 – 2019
- 2018
- [j4]Junzhi Li, Ying Tan:
The bare bones fireworks algorithm: A minimalist global optimizer. Appl. Soft Comput. 62: 454-462 (2018) - [j3]Junzhi Li, Ying Tan:
Loser-Out Tournament-Based Fireworks Algorithm for Multimodal Function Optimization. IEEE Trans. Evol. Comput. 22(5): 679-691 (2018) - [c10]Xuemei Yet, Junzhi Li, Bo Xu, Ying Tan:
Which Mapping Rule in the Fireworks Algorithm is Better for Large Scale Optimization. CEC 2018: 1-8 - 2017
- [j2]Shaoqiu Zheng, Junzhi Li, Andreas Janecek, Ying Tan:
A Cooperative Framework for Fireworks Algorithm. IEEE ACM Trans. Comput. Biol. Bioinform. 14(1): 27-41 (2017) - [j1]Junzhi Li, Shaoqiu Zheng, Ying Tan:
The Effect of Information Utilization: Introducing a Novel Guiding Spark in the Fireworks Algorithm. IEEE Trans. Evol. Comput. 21(1): 153-166 (2017) - 2016
- [c9]Junzhi Li, Ying Tan:
Enhancing interaction in the fireworks algorithm by dynamic resource allocation and fitness-based crowdedness-avoiding strategy. CEC 2016: 4015-4021 - [i3]Junzhi Li, Ying Tan:
Information Utilization Ratio in Heuristic Optimization Algorithms. CoRR abs/1604.01643 (2016) - 2015
- [c8]Shaoqiu Zheng, Chao Yu, Junzhi Li, Ying Tan:
Exponentially decreased dimension number strategy based dynamic search fireworks algorithm for solving CEC2015 competition problems. CEC 2015: 1083-1090 - [c7]Junzhi Li, Ying Tan:
Orienting mutation based fireworks algorithm. CEC 2015: 1265-1271 - [i2]Ying Tan, Junzhi Li, Zhongyang Zheng:
Introduction and Ranking Results of the ICSI 2014 Competition on Single Objective Optimization. CoRR abs/1501.02128 (2015) - [i1]Shaoqiu Zheng, Junzhi Li, Andreas Janecek, Ying Tan:
A Cooperative Framework for Fireworks Algorithm. CoRR abs/1505.00075 (2015) - 2014
- [c6]Zhongyang Zheng, Junzhi Li, Jie Li, Ying Tan:
Avoiding decoys in multiple targets searching problems using swarm robotics. IEEE Congress on Evolutionary Computation 2014: 784-791 - [c5]Junzhi Li, Shaoqiu Zheng, Ying Tan:
Adaptive Fireworks Algorithm. IEEE Congress on Evolutionary Computation 2014: 3214-3221 - [c4]Shaoqiu Zheng, Andreas Janecek, Junzhi Li, Ying Tan:
Dynamic search in fireworks algorithm. IEEE Congress on Evolutionary Computation 2014: 3222-3229 - [c3]Shaoqiu Zheng, Lang Liu, Chao Yu, Junzhi Li, Ying Tan:
Fireworks Algorithm and Its Variants for Solving ICSI2014 Competition Problems. ICSI (2) 2014: 442-451 - [c2]Zhongyang Zheng, Jie Li, Junzhi Li, Ying Tan:
Improved group explosion strategy for searching multiple targets using swarm robotics. SMC 2014: 246-251 - [c1]Chao Yu, Junzhi Li, Ying Tan:
Improve enhanced fireworks algorithm with differential mutation. SMC 2014: 264-269
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
