Chenle Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chenle Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Bin Wang
School of Computer Science and Engineering, Xi’an University of Technology, Xi’an 710048, China
2 shared publications - Feng Wang
School of Computer Science and Engineering, Xi’an University of Technology, Xi’an 710048, China
1 shared publication - Kan Wang
Xi’an University of Technology
1 shared publication - Qiaoyong Jiang
The Key Laboratory of Network Computing and Security Technology of Shaanxi Province, Xi’an University of Technology, Xi’an, China
1 shared publication - Wenjuan He
School of Computer Science and Engineering, Xi’an University of Technology, Xi’an, China
1 shared publication
Latest Publications
- 20 August 2024
- Published by Springer Nature
- p. 481-493
An Improved Genetic Algorithm for College Course Scheduling
- 20 August 2024
- Published by Springer Nature
- p. 481-493
An Improved Genetic Algorithm for College Course Scheduling
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Multiobjective Differential Evolution with Discrete Elite Guide in Internet of Vehicles Roadside Unit Deployment
In a vehicular ad hoc network (VANET), roadside units (RSUs) are installed at roadside and intersections to process vehicle‐to‐infrastructure communication, collect and analyse intelligent vehicle traffic data, send information to vehicles, and achieve early warning of safe driving of vehicles. Owning to the high cost of implementing and maintaining RSUs, it is of vital importance to determine where and how many RSUs to deploy. Optimal RSU deployment requires both a small number of RSUs and the maximum coverage of vehicle running process, which constitutes a conflicting multiobjective problem. Nevertheless, existing works do not explicitly utilize multiobjective algorithm to solve the RSU deployment problem. Therefore, a multiobjective differential evolution approach is proposed in this work to solve the problem. Firstly, to conquer the complexity of urban road RSU deployment, the static model is established. Secondly, in the proposed multiobjective differential evolution with discrete elitist guide (MODE‐deg), the sigmoid function is applied to discrete individual values. Finally, elitist individuals are selected based on crowding distance ranking and nondominated ranking to generate new individuals, which further improve the convergence speed and population performance. Experimental results show that MODE‐deg can generate the optimal nondominant solution set with good convergence and diversity, in contrast to other multiobjective evolutionary algorithms in five test functions of ZDT.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessMultiobjective Differential Evolution with Discrete Elite Guide in Internet of Vehicles Roadside Unit Deployment
In a vehicular ad hoc network (VANET), roadside units (RSUs) are installed at roadside and intersections to process vehicle‐to‐infrastructure communication, collect and analyse intelligent vehicle traffic data, send information to vehicles, and achieve early warning of safe driving of vehicles. Owning to the high cost of implementing and maintaining RSUs, it is of vital importance to determine where and how many RSUs to deploy. Optimal RSU deployment requires both a small number of RSUs and the maximum coverage of vehicle running process, which constitutes a conflicting multiobjective problem. Nevertheless, existing works do not explicitly utilize multiobjective algorithm to solve the RSU deployment problem. Therefore, a multiobjective differential evolution approach is proposed in this work to solve the problem. Firstly, to conquer the complexity of urban road RSU deployment, the static model is established. Secondly, in the proposed multiobjective differential evolution with discrete elitist guide (MODE‐deg), the sigmoid function is applied to discrete individual values. Finally, elitist individuals are selected based on crowding distance ranking and nondominated ranking to generate new individuals, which further improve the convergence speed and population performance. Experimental results show that MODE‐deg can generate the optimal nondominant solution set with good convergence and diversity, in contrast to other multiobjective evolutionary algorithms in five test functions of ZDT.