Остановите войну!
for scientists:
default search action
Zhigang Ren
- > Home > Persons > Zhigang Ren
Publications
- 2023
- [j51]An Chen, Zhigang Ren, Wenhua Guo, Yongsheng Liang, Zuren Feng:
An Efficient Adaptive Differential Grouping Algorithm for Large-Scale Black-Box Optimization. IEEE Trans. Evol. Comput. 27(3): 475-489 (2023) - 2022
- [j50]Zu-ren Feng, Ruizhi Sha, Zhi-Gang Ren:
A Chattering-Reduction Sliding Mode Control Algorithm for Affine Systems With Input Matrix Uncertainty. IEEE Access 10: 58982-58996 (2022) - 2020
- [j30]Yongsheng Liang, Zhigang Ren, Xianghua Yao, Zuren Feng, An Chen, Wenhua Guo:
Enhancing Gaussian Estimation of Distribution Algorithm by Exploiting Evolution Direction With Archive. IEEE Trans. Cybern. 50(1): 140-152 (2020) - 2019
- [j27]Zhigang Ren, Bei Pang, Muyi Wang, Zuren Feng, Yongsheng Liang, An Chen, Yipeng Zhang:
Surrogate model assisted cooperative coevolution for large scale optimization. Appl. Intell. 49(2): 513-531 (2019) - [j21]Zhigang Ren, Yongsheng Liang, Aimin Zhang, Yang Yang, Zuren Feng, Lin Wang:
Boosting Cooperative Coevolution for Large Scale Optimization With a Fine-Grained Computation Resource Allocation Strategy. IEEE Trans. Cybern. 49(12): 4180-4193 (2019) - 2018
- [j15]Chenlong He, Zuren Feng, Zhigang Ren:
Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range. Sensors 18(2): 446 (2018) - 2017
- [j14]Honghao Chang, Zuren Feng, Zhigang Ren:
Community Detection Using Dual-Representation Chemical Reaction Optimization. IEEE Trans. Cybern. 47(12): 4328-4341 (2017) - 2016
- [c8]Chenlong He, Zuren Feng, Zhigang Ren:
Collective motion of self-propelled particles without collision and fragmentation. SMC 2016: 3228-3233 - 2014
- [j8]Zhigang Ren, Aimin Zhang, Changyun Wen, Zuren Feng:
A Scatter Learning Particle Swarm Optimization Algorithm for Multimodal Problems. IEEE Trans. Cybern. 44(7): 1127-1140 (2014) - 2013
- [c5]Honghao Chang, Zuren Feng, Zhigang Ren:
Community detection using Ant Colony Optimization. IEEE Congress on Evolutionary Computation 2013: 3072-3078 - 2012
- [j6]Zhi-Gang Ren, Zu-ren Feng, Aimin Zhang:
Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem. Inf. Sci. 182(1): 15-29 (2012) - 2010
- [j5]Zhi-Gang Ren, Zu-ren Feng, Liangjun Ke, Zhao-Jun Zhang:
New ideas for applying ant colony optimization to the set covering problem. Comput. Ind. Eng. 58(4): 774-784 (2010) - [j4]Liangjun Ke, Zuren Feng, Zhigang Ren, Xiaoliang Wei:
An ant colony optimization approach for the multidimensional knapsack problem. J. Heuristics 16(1): 65-83 (2010) - [c2]Zhigang Ren, Zuren Feng:
An ant colony optimization approach to the multiple-choice multidimensional knapsack problem. GECCO 2010: 281-288 - 2008
- [j1]Liangjun Ke, Zuren Feng, Zhigang Ren:
An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognit. Lett. 29(9): 1351-1357 (2008) - [c1]Zhigang Ren, Zuren Feng, Liangjun Ke, Hong Chang:
A fast and efficient ant colony optimization approach for the set covering problem. IEEE Congress on Evolutionary Computation 2008: 1839-1844
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 2024-04-10 23:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint