meng zhang

Dr. meng zhang

Jilin Univeristy

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 February 2010 in Information Processing Letters
Verified
Journal Article
Closed access
MZMeng Zhang
Meng Zhang
MZmeng zhang
meng zhang
LHLiang Hu
Liang Hu

1 October 2007
Verified
Conference Paper
Closed access
MZmeng zhang
meng zhang
ZPZhi-Li Pei
Zhi-Li Pei
JYJin-Hui Yang
Jin-Hui Yang
YLYanchun Liang
Yanchun Liang
In this paper, we introduce two improvements on ant colony optimization (ACO) algorithm: route optimization and individual variation. The first is an optimized implementation of ACO, by which the running time of ants routing is largely reduced. The results of the simulated experiments show that the improved algorithm not only reduces the number of routing in the ACO but also surpasses existing algorithms in performance in solving large-scale TSP problems. In the second improvement, we introduce individual variation to ACO, by which the ants have different routing strategies. Simulation results show that the speed of convergence of ACO algorithm could be enhanced greatly.

27 February 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
MZmeng zhang
meng zhang
HYHongda Yu
Hongda Yu
This paper proposes a hybrid algorithm based on the ant colony and Physarum Polycephalum algorithms. The positive feedback mechanism is used to find the globally optimal path. The crossover and mutation operations of the genetic algorithm are introduced into the path search mechanism for the first time. The Van der Waals force is applied to the pheromone updating mechanism. Simulation results show that the improved algorithm has advantages in quality and speed of solution compared with other mainstream algorithms. This paper provides fast and accurate route methods for solving the Traveling Salesman Problem first and a delivery scheme is also presented for UAVs to realize “contactless delivery” to users in the Changchun Mingzhu District during the COVID-19 epidemic, which confirms the practicability and robustness of the algorithm.

20 September 2022 in Frontiers in Bioengineering and Biotechnology
Verified
Journal Article
Open access
MZmeng zhang
meng zhang
ZYZhou Yangkun
Zhou Yangkun
YHYu Hongda
Yu Hongda
WHWang Hong
Wang Hong
This paper presents an improved Discrete Salp Swarm Algorithm based on the Ant Colony System (DSSACS). Firstly, we use the Ant Colony System (ACS) to optimize the initialization of the salp colony and discretize the algorithm, then use the crossover operator and mutation operator to simulate the foraging behavior of the followers in the salp colony. We tested DSSACS with several algorithms on the TSP dataset. For TSP files of different sizes, the error of DSSACS is generally between 0.78% and 2.95%, while other algorithms are generally higher than 2.03%, or even 6.43%. The experiments show that our algorithm has a faster convergence speed, better positive feedback mechanism, and higher accuracy. We also apply the new algorithm for the Wireless rechargeable sensor network (WRSN) problem. For the selection of the optimal path, the path selected by DSSACS is always about 20% shorter than the path selected by ACS. Results show that DSSACS has obvious advantages over other algorithms in MCV’s multi-path planning and saves more time and economic cost than other swarm intelligence algorithms in the wireless rechargeable sensor network.

22 February 2023 in Frontiers in Energy Research
Verified
Journal Article
Open access
MZmeng zhang
meng zhang
YLYang Lv
Yang Lv
This paper proposes an improved bacterial foraging algorithm for electrical load distribution to impro-ve power plants’ efficiency and reduce energy consumption costs. In the chemotaxis stage, the adaptive step size is introduced to accelerate the random search speed compared with the traditional algorithm. In the replication stage, a hybrid crisscross operator is proposed to replace the traditional binary replication method in the algorithm to ensure the diversity of the population and improve the efficiency of the algorithm. The adaptive dynamic probability is used instead of the initial fixed probability to improve the global search performance of the algorithm. The mathematical model of electrical load distribution in a natural power plant is established, and the improved bacterial foraging algorithm is used to solve the model. Through comparative analysis of two power plant unit experiments, it is proved that the results of the improved algorithm can reduce 3.671% and 1.06% respectively compared with the particle swarm optimization algorithm, and 7.26% and 1.37% respectively compared with the traditional bacterial foraging algorithm, which can significantly reduce the coal consumption of the power plant.

1 December 2016 in Information Processing Letters
Verified
Journal Article
Closed access
MZMeng Zhang
Meng Zhang
MZmeng zhang
meng zhang
CHChen Hou
Chen Hou