Zequn Wei

Zequn Wei

Beijing University of Posts and Telecommunications

I work at Beijing University of Posts and Telecommunications (BUPT) as an assistant professor now in Beijing.

I graduated from Northwestern Polytechnical University with a bachelor’s degree and a master’s degree, and a Ph.D in Computer Science from Université d’Angers, France, supervised by Prof. Jin-Kao Hao.

My research interest includes large-scale combinatorial optimization, intelligent optimization algorithms, big data and artificial intelligence. which are mainly applied in knapsack problems, routing problems and scheduling problems, etc. The main published papers appear in EJOR, COR, ESWA and KBS, etc. I have received several research grants from National Science Foundation of China (NSFC) and Zhongxing Telecommunication Equipment Corporation (ZTE), etc.

📝 Publications

Journal Papers

  • [1] Zequn Wei, Jin-Kao Hao, Jintong Ren, Qinghua Wu, Eduardo Rodriguez-Tello. An intensification-driven search algorithm for the family traveling salesman problem with incompatibility constraints. Knowledge-Based Systems, 2024, 302: 112378.
  • [2] Zequn Wei, Jin-Kao Hao, Jintong Ren, Fred Glover. Responsive strategic oscillation for solving the disjunctively constrained knapsack problem, European Journal of Operational Research, 2023,309(3): 993-1009.
  • [3] Zequn Wei, Jin-Kao Hao. Iterated hyperplane search for the budgeted maximum coverage problem. Expert Systems with Applications, 2023, 214: 119078.
  • [4] Zequn Wei, Jin-Kao Hao. A threshold search based memetic algorithm for the disjunctively constrained knapsack problem. Computers & Operations Research, 2021, 136: 105447.
  • [5] Liwen Li, Zequn Wei, Jin-Kao Hao, Kun He. Probability learning based tabu search for the budgeted maximum coverage problem. Expert Systems with Applications, 2021: 115310.
  • [6] Zequn Wei, Jin-Kao Hao. Multistart solution-based tabu search for the Set-Union Snapsack Problem. Applied Soft Computing, 2021, 105: 107260.
  • [7] Zequn Wei, Jin-Kao Hao. Kernel based tabu search for the Set-union Knapsack Problem. Expert Systems with Applications, 2021, 165: 113802.
  • [8] Zequn Wei, Jin-Kao Hao. Iterated two-phase local search for the Set-Union Knapsack Problem[J]. Future Generation Computer Systems, 2019, 101: 1005-1017.

Papers in Conference Proceedings

  • [1] Zequn Wei, Jianing Yu, Jintong Ren, Wei Duan and Dexin Wu. Progressive Simulated Annealing Algorithm for the Pipeline Allocation Problem of Protocol Independent Switch Architecture Chips. 2024 6th International Conference on Data-driven Optimization of Complex Systems (DOCS-2024), Hangzhou, China, 2024, pp. 243-249.
  • [2] Yiting Wang, Yawen Li, Zequn Wei*, Junqi Li. Hybrid Evolutionary Algorithm for the Overlap Constrained Resource Allocation Problem in Wireless Networks. The 38th International Conference on Advanced Information Networking and Applications (AINA-2024), Kitakyushu, Japan, 2024, pp. 245-256.
  • [3] Yushan Yang, Mengling Yan, Zeqing Liu, Zequn Wei*. Opposition-based Memetic Algorithm for the Shared Weapon Target Assignment Problem. 2022 China Automation Congress (CAC-2022), Xiamen, China, 2022, pp. 1951-1956.

📖 Educations

  • Doctor, Université d’Angers (UA), Angers, France.
  • Master, Northwestern Polytechnical University (NPU), Xi’an, China.
  • Undergraduate, Northwestern Polytechnical University (NPU), Xi’an, China.

💻 Working Experience

  • Assistant Professor, Beijing University of Posts and Telecommunications (BUPT), Beijing, China, 2021 - now.