A Cryptosystem of Low Key Authentic Degree. - Yong Wang 027 (WGEC, 2009)

On Relativity of Probability and Information. - Yong Wang 027 (CSEE (3), 2011)

The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. - Yong Wang 027 (Comput. Ind. Eng., 2014)

An approximate method to compute a sparse graph for traveling salesman problem. - Yong Wang 027 (Expert Syst. Appl., 2015)

A Genetic Algorithm with the Mixed Heuristics for Traveling Salesman Problem. - Yong Wang 027 (Int. J. Comput. Intell. Appl., 2015)

Statistical analysis of frequency graph for traveling salesman problem. - Yong Wang 027 (J. Intell. Fuzzy Syst., 2015)

Hybrid Max-Min ant system with four vertices and three lines inequality for traveling salesman problem. - Yong Wang 027 (Soft Comput., 2015)

A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals. - Yong Wang 027; Jeffrey B. Remmel (J. Graph Algorithms Appl., 2016)

A Hybrid Particle Swarm Optimization Method for Traveling Salesman Problem. - Yong Wang 027; Ning Xu (Int. J. Appl. Metaheuristic Comput., 2017)

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals. - Yong Wang 027; Jeffrey B. Remmel (FAW, 2018)

An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP. - Yong Wang 027; Jeffrey B. Remmel (Appl. Intell., 2018)

Bounded Degree Graphs Computed for Traveling Salesman Problem Based on Frequency Quadrilaterals. - Yong Wang 027 (COCOA, 2019)

Special Frequency Quadrilaterals and an Application. - Yong Wang 027 (NCTCS, 2019)

Edges Elimination for Traveling Salesman Problem Based on Frequency K_5 s. - Yong Wang 027 (WCGO, 2019)

Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem. - Yong Wang 027; Y. W. Wu; N. Xu (Comput. Ind. Eng., 2019)

Frequency Graphs for Travelling Salesman Problem Based on Ant Colony Optimization. - Yong Wang 027; Yiwen Wu (Int. J. Comput. Intell. Appl., 2019)

A Method to Search Traveling Salesman Problem Backbones Based on GA and Frequency Graph. - Yong Wang 027; Changxin Geng; Yiwen Wu (J. Comput., 2019)

Sufficient and Necessary Conditions for an Edge in the Optimal Hamiltonian Cycle Based on Frequency Quadrilaterals. - Yong Wang 027 (J. Optim. Theory Appl., 2019)

The Frequency of the Optimal Hamiltonian Cycle Computed with Frequency Quadrilaterals for Traveling Salesman Problem. - Yong Wang 027; Zunpu Han (AAIM, 2020)

Fractional PSOGSA Algorithm Approach to Solve Optimal Reactive Power Dispatch Problems With Uncertainty of Renewable Energy Resources. - Noor Habib Khan; Yong Wang 027; De Tian; Raheela Jamal; Mohamed Ebeed; Qirong Deng (IEEE Access, 2020)

Design of Fractional Particle Swarm Optimization Gravitational Search Algorithm for Optimal Reactive Power Dispatch Problems. - Noor Habib Khan; Yong Wang 027; De Tian; Muhammad Asif Zahoor Raja; Raheela Jamal; Muhammad Yasir (IEEE Access, 2020)

The Distribution of Edge-Frequencies Computed with Frequency Quadrilaterals for Traveling Salesman Problem. - Yong Wang 027; Ruobing Shen (NCTCS, 2021)

A Novel Modified Lightning Attachment Procedure Optimization Technique for Optimal Allocation of the FACTS Devices in Power Systems. - Noor Habib Khan; Yong Wang 027; De Tian; Raheela Jamal; Sheeraz Iqbal; Mubaarak Abdulrahman Abdu Saif; Mohamed Ebeed (IEEE Access, 2021)

Optimal Siting and Sizing of SSSC Using Modified Salp Swarm Algorithm Considering Optimal Reactive Power Dispatch Problem. - Noor Habib Khan; Yong Wang 027; De Tian; Raheela Jamal; Salah Kamel; Mohamed Ebeed (IEEE Access, 2021)

Ant colony optimization for traveling salesman problem based on parameters optimization. - Yong Wang 027; Zunpu Han (Appl. Soft Comput., 2021)

Assembly sequence optimization based on hybrid symbiotic organisms search and ant colony optimization. - Yong Wang 027; Changxin Geng; Ning Xu (Soft Comput., 2021)

The Polynomial Randomized Algorithm to Compute Bounded Degree Graph for TSP Based on Frequency Quadrilaterals. - Yong Wang 027 (NCTCS, 2022)

Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals. - Yong Wang 027 (Theor. Comput. Sci., 2024)

Frequency bounds for edges and paths in optimal Hamiltonian cycle based on frequency Kis. - Yong Wang 027; Pengbo Liu; Yanlong He (Expert Syst. Appl., 2025)

The frequency Kis for symmetrical traveling salesman problem. - Yong Wang 027 (CoRR, 2025)