Zhenyu Lei
Papers
1
Total Citations
14
H-Index
1
About
Zhenyu Lei is a rising researcher in computational optimization and operations research, with a focus on developing efficient algorithms for complex combinatorial problems. His most-cited work, "An effective memetic algorithm for the close-enough traveling salesman problem" (2024, 14 citations), demonstrates his expertise in designing hybrid metaheuristics that combine evolutionary strategies with local search. This contribution addresses a challenging variant of the classic traveling salesman problem, where visits to neighborhoods rather than exact points are required—a problem with applications in drone routing, wireless sensor networks, and logistics. Lei’s approach achieves significant improvements in solution quality and computational efficiency, as evidenced by its rapid citation growth. His work bridges theoretical algorithm design and practical real-world constraints, making him a notable figure in the emerging field of memetic computation. With a clear trajectory toward impactful, application-driven research, Zhenyu Lei is establishing himself as a promising voice in optimization, particularly for problems that blur the line between continuous and discrete search spaces.
Research Focus
Key Achievements
Top Papers
- 1