Zhouxing Su

Orcid: 0000-0002-4794-9833

According to our database1, Zhouxing Su authored at least 34 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A Two-Stage Adaptive Search Algorithm for the 2-D Rectangle Packing Area Minimization Problem.
IEEE Trans. Syst. Man Cybern. Syst., December, 2025

SAT-BO: Verification Rule Learning and Optimization for FraudTransaction Detection.
CoRR, July, 2025

An oscillation based simulated annealing algorithm for the single row facility layout problem.
Eng. Appl. Artif. Intell., 2025

PACE Solver Description: Weighting-Based Local Search Heuristic for the Hitting Set Problem.
Proceedings of the 20th International Symposium on Parameterized and Exact Computation, 2025

NS4S: Neighborhood Search for Scheduling Problems Via Large Language Models.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

A Weighted-Based Fast Local Search for α-Neighbor p-Center Problem.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

A Multi-start Variable Neighborhood Tabu Search Algorithm for the Cyclic Bandwidth Problem.
Proceedings of the Computing and Combinatorics, 2025

Adaptive Weighting-Based Local Search for Route Number Minimization for Vehicle Routing Problem with Time Windows.
Proceedings of the Computing and Combinatorics, 2025

An Elite-guided Weighted Simulated Annealing Algorithm for the Clique Partitioning Problem.
Proceedings of the AAAI-25, Sponsored by the Association for the Advancement of Artificial Intelligence, February 25, 2025

2024
A Weighted Vertex Cover-Based Intensification Tabu Search for the Capacitated Dispersion Problem.
IEEE Trans. Emerg. Top. Comput. Intell., December, 2024

Neighborhood Combination Search for Single-Machine Scheduling with Sequence-Dependent Setup Time.
J. Comput. Sci. Technol., May, 2024

MS-CLS: An Effective Partitioning and Placement Metaheuristic for Wafer-Scale Physics Modeling.
IEEE Trans. Emerg. Top. Comput. Intell., April, 2024

Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm.
Expert Syst. Appl., March, 2024

A Swap Relaxation-Based Local Search for the Latin Square Completion Problem.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

A General Heuristic Approach for Maximum Polygon Packing (CG Challenge).
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
An Effective Scoring-Based Metaheuristic Algorithm for Rectilinear Block Placement.
IEEE Trans. Emerg. Top. Comput. Intell., December, 2023

A vertex weighting-based double-tabu search algorithm for the classical p-center problem.
Comput. Oper. Res., December, 2023

Dual-neighborhood iterated local search for routing and wavelength assignment.
Comput. Oper. Res., December, 2023

A Two-Stage Iterated Local Search Algorithm for the Capacitated p-Center Problem.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023

A Memetic Algorithm for the Multi-Depot Vehicle Routing Problem.
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2023

A Heuristic Method for Data Allocation and Task Scheduling on Heterogeneous Multiprocessor Systems Under Memory Constraints.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2023

2022
A two-phase tabu search based evolutionary algorithm for the maximum diversity problem.
Discret. Optim., 2022

PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Weighting-Based Tabu Search Algorithm for the p-Next Center Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem.
Comput. Oper. Res., 2021

Weighting-based Variable Neighborhood Search for Optimal Camera Placement.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
A Matheuristic Algorithm for the Inventory Routing Problem.
Transp. Sci., 2020

Effective Approaches to Solve P-Center Problem via Set Covering and SAT.
IEEE Access, 2020

Local Search based on a New Neighborhood for Routing and Wavelength Assignment.
Proceedings of the 2020 IEEE International Conference on Systems, Man, and Cybernetics, 2020

Vertex Weighting-Based Tabu Search for p-Center Problem.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

A Two-Stage Matheuristic Algorithm for Classical Inventory Routing Problem.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Weighting-based parallel local search for optimal camera placement and unicost set covering.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes.
IEEE Access, 2019


  Loading...