Zhang-Hua Fu

Orcid: 0000-0002-3740-7408

According to our database1, Zhang-Hua Fu authored at least 38 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Global optimization and structural analysis of Coulomb and logarithmic potentials on the unit sphere using a population-based heuristic approach.
Expert Syst. Appl., March, 2024

Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems.
IEEE Trans Autom. Sci. Eng., January, 2024

2023
Parallel Bounded Search for the Maximum Clique Problem.
J. Comput. Sci. Technol., September, 2023

Listing maximal <i>k</i>-relaxed-vertex connected components from large graphs.
Inf. Sci., 2023

An effective hybrid search algorithm for the multiple traveling repairman problem with profits.
Eur. J. Oper. Res., 2023

A Hierarchical Destroy and Repair Approach for Solving Very Large-Scale Travelling Salesman Problem.
CoRR, 2023

2022
Multi-Neighborhood Simulated Annealing-Based Iterated Local Search for Colored Traveling Salesman Problems.
IEEE Trans. Intell. Transp. Syst., 2022

Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization.
IEEE Trans. Computers, 2022

Knowledge-guided two-stage memetic search for the pickup and delivery traveling salesman problem with FIFO loading.
Knowl. Based Syst., 2022

Intensification-driven local search for the traveling repairman problem with profits.
Expert Syst. Appl., 2022

Iterated dynamic thresholding search for packing equal circles into a circular container.
Eur. J. Oper. Res., 2022

Cooperatively Scheduling Hundreds of Fetch and Freight Robots in an Autonomous Warehouse.
Proceedings of the IEEE International Conference on Real-time Computing and Robotics, 2022

A Dual Channel Intent Evolution Network for Predicting Period-Aware Travel Intentions at Fliggy.
Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021
Variable Population Memetic Search: A Case Study on the Critical Node Problem.
IEEE Trans. Evol. Comput., 2021

Late acceptance-based heuristic algorithms for identifying critical nodes of weighted graphs.
Knowl. Based Syst., 2021

TSingNet: Scale-aware and context-rich feature learning for traffic sign detection and recognition in the wild.
Neurocomputing, 2021

Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping.
Eur. J. Oper. Res., 2021

Feature Importance-aware Graph Attention Network and Dueling Double Deep Q-Network Combined Approach for Critical Node Detection Problems.
CoRR, 2021

Neighborhood decomposition-driven variable neighborhood search for capacitated clustering.
Comput. Oper. Res., 2021

A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

An Efficient Parallel Self-assembly Planning Algorithm for Modular Robots in Environments with Obstacles.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Solving Colored Traveling Salesman Problem via Multi-neighborhood Simulated Annealing Search.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021

Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Generalize a Small Pre-trained Model to Arbitrarily Large TSP Instances.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Knowledge Refinery: Learning from Decoupled Label.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Multipopulation cooperative particle swarm optimization with a mixed mutation strategy.
Inf. Sci., 2020

Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem.
Expert Syst. Appl., 2020

Communicative Representation Learning on Attributed Molecular Graphs.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
A Tabu Search Approach With Dynamical Neighborhood Size for Solving the Maximum Min-Sum Dispersion Problem.
IEEE Access, 2019

Dynamically Reconstructing Minimum Spanning Trees After Swapping Pairwise Vertices.
IEEE Access, 2019

An Efficient 2-opt Operator for the Robotic Task Sequencing Problem.
Proceedings of the 2019 IEEE International Conference on Real-time Computing and Robotics, 2019

2018
Dynamic Task Sequencing of Manipulator by Monte Carlo Tree Search.
Proceedings of the IEEE International Conference on Robotics and Biomimetics, 2018

A Fast Vertex-Swap Operator for the Prize-Collecting Steiner Tree Problem.
Proceedings of the Computational Science - ICCS 2018, 2018

2017
Swap-vertex based neighborhood for Steiner tree problems.
Math. Program. Comput., 2017

Knowledge-guided local search for the prize-collecting Steiner tree problem in graphs.
Knowl. Based Syst., 2017

2015
Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints.
INFORMS J. Comput., 2015

A three-phase search approach for the quadratic minimum spanning tree problem.
Eng. Appl. Artif. Intell., 2015

2014
Breakout local search for the Steiner tree problem with revenue, budget and hop constraints.
Eur. J. Oper. Res., 2014


  Loading...