This map shows the geographic impact of Chunming Ye's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Chunming Ye with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chunming Ye more than expected).
This network shows the impact of papers produced by Chunming Ye. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Chunming Ye. The network helps show where Chunming Ye may publish in the future.
Co-authorship network of co-authors of Chunming Ye
This figure shows the co-authorship network connecting the top 25 collaborators of Chunming Ye.
A scholar is included among the top collaborators of Chunming Ye based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Chunming Ye. Chunming Ye is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ye, Chunming, et al.. (2019). IMSSA for TFT-LCD Panel Array Process Scheduling Problem Considering Energy Saving. 30(24). 2994–3003.1 indexed citations
5.
Ye, Chunming. (2013). Bat algorithm with the characteristics of Lévy flights. Caai Transactions on Intelligent Systems.12 indexed citations
6.
Jiao, Yang & Chunming Ye. (2013). Novel firefly algorithm for solving Job Shop scheduling problem. 49(11). 213–215.1 indexed citations
7.
Ye, Chunming. (2013). Bat Algorithm with Chaotic Search Strategy and Analysis of Its Property. Jisuanji fangzhen.9 indexed citations
8.
Ye, Chunming. (2013). Using firefly algorithm to solve permutation flow-shop scheduling problem. Jisuanji yingyong yanjiu.
9.
Ye, Chunming. (2012). Fuzzy flow-shop scheduling problem based on Quantum Particle Swarm Optimization. Computer Engineering and Applications Journal.1 indexed citations
10.
Ye, Chunming. (2012). Pre-maintenance Scheduling with MRO Service Provider. Journal of systems management.1 indexed citations
11.
Ye, Chunming. (2012). Solving Permutation Flow Shop Scheduling Problem by Firefly Algorithm. Industrial Engineering and Management.4 indexed citations
12.
Ye, Chunming, et al.. (2010). Research on DNA encoding design constraint by minimal free energy. Computer Engineering and Applications Journal. 46(12). 25–27.2 indexed citations
13.
Ye, Chunming. (2009). Application study on hybrid quantum algorithm in traveling salesman problem. Journal of the University of Shanghai for Science and Technology.
14.
Ye, Chunming. (2009). Quantum particle swarm optimization for flow-shop scheduling problem with fuzzy delivery time. Computer Engineering and Applications Journal.1 indexed citations
15.
Ye, Chunming. (2009). Research on the QoS Multicast Routing Problem Based on Quantum Particle Swarm Algorithm. Microelectronics & Computer.1 indexed citations
16.
Ye, Chunming. (2008). Research on QPSO Algorithm for Vehicle Routing Problem. Logistics Sci-tech.1 indexed citations
17.
Ye, Chunming. (2008). Research on cultural evolutionary algorithms applied to Job shop problems. Manufacturing Automation.1 indexed citations
18.
Ye, Chunming. (2008). Study on Selection of Emergency Logistics Scheme Based on FAHP. Logistics Sci-tech.1 indexed citations
19.
Ye, Chunming. (2005). Improved Particle Swarm Optimization Algorithm for the Single Level Capacitated Dynamic Lot-sizing Problem. Industrial Engineering and Management.2 indexed citations
20.
Ye, Chunming, et al.. (2004). Research and Implementation of the IE Laboratory Construction. Industrial Engineering and Management.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.