Gang Ke
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gang Ke has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Ruey-Shun Chen
Department of Computer Engineering, Dongguan Polytechnic, Dongguan, China
1 shared publication Shi Wang
Department of Computer Engineering, Dongguan Polytechnic, Dongguan, China
1 shared publicationXin Zhang
School of Information Science and Engineering, Linyi University, Linyi, China
1 shared publicationYeh-Cheng Chen
Department of Computer Science, University of California, Davis, CA, USA
1 shared publication
Latest Publications
- 6 January 2020
- Published by Taylor & Francis in Enterprise Information Systems
- Vol. 16 (2) , 379-401
Using ant colony optimisation for improving the execution of material requirements planning for smart manufacturing
In this paper, ant colony optimization algorithm is used, and then the records in the supply and demand documents in the material requirement planning (MRP) are used to simulate the city points that the salesperson moves, so that the artificial ants can move between cities. To find the shortest path through all cities, that is, to find the shortest path of MRP in the main file of supply and demand, to reduce the system execution time, improve the efficiency of related personnel. Experimental results show that compared with other algorithms, ACO algorithm can effectively shorten the deployment time of MRP and greatly improve the implementation efficiency.
- 6 January 2020
- Published by Taylor & Francis in Enterprise Information Systems
- Vol. 16 (2) , 379-401
Using ant colony optimisation for improving the execution of material requirements planning for smart manufacturing
In this paper, ant colony optimization algorithm is used, and then the records in the supply and demand documents in the material requirement planning (MRP) are used to simulate the city points that the salesperson moves, so that the artificial ants can move between cities. To find the shortest path through all cities, that is, to find the shortest path of MRP in the main file of supply and demand, to reduce the system execution time, improve the efficiency of related personnel. Experimental results show that compared with other algorithms, ACO algorithm can effectively shorten the deployment time of MRP and greatly improve the implementation efficiency.