Yong Wang
Orcid: 0000-0003-4029-4018Affiliations:
- North China Electric Power University, School of Renewable Energy, Huilongguan/Beijing, China
According to our database1,
Yong Wang
authored at least 26 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Theor. Comput. Sci., February, 2024
2022
The Polynomial Randomized Algorithm to Compute Bounded Degree Graph for TSP Based on Frequency Quadrilaterals.
Proceedings of the Theoretical Computer Science - 40th National Conference, 2022
2021
Assembly sequence optimization based on hybrid symbiotic organisms search and ant colony optimization.
Soft Comput., 2021
Ant colony optimization for traveling salesman problem based on parameters optimization.
Appl. Soft Comput., 2021
Optimal Siting and Sizing of SSSC Using Modified Salp Swarm Algorithm Considering Optimal Reactive Power Dispatch Problem.
IEEE Access, 2021
A Novel Modified Lightning Attachment Procedure Optimization Technique for Optimal Allocation of the FACTS Devices in Power Systems.
IEEE Access, 2021
The Distribution of Edge-Frequencies Computed with Frequency Quadrilaterals for Traveling Salesman Problem.
Proceedings of the Theoretical Computer Science, 2021
2020
Design of Fractional Particle Swarm Optimization Gravitational Search Algorithm for Optimal Reactive Power Dispatch Problems.
IEEE Access, 2020
Fractional PSOGSA Algorithm Approach to Solve Optimal Reactive Power Dispatch Problems With Uncertainty of Renewable Energy Resources.
IEEE Access, 2020
The Frequency of the Optimal Hamiltonian Cycle Computed with Frequency Quadrilaterals for Traveling Salesman Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
Sufficient and Necessary Conditions for an Edge in the Optimal Hamiltonian Cycle Based on Frequency Quadrilaterals.
J. Optim. Theory Appl., 2019
A Method to Search Traveling Salesman Problem Backbones Based on GA and Frequency Graph.
J. Comput., 2019
Int. J. Comput. Intell. Appl., 2019
Discrete symbiotic organism search with excellence coefficients and self-escape for traveling salesman problem.
Comput. Ind. Eng., 2019
Proceedings of the Optimization of Complex Systems: Theory, 2019
Proceedings of the Theoretical Computer Science - 37th National Conference, 2019
Bounded Degree Graphs Computed for Traveling Salesman Problem Based on Frequency Quadrilaterals.
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP.
Appl. Intell., 2018
A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals.
Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018
2017
Int. J. Appl. Metaheuristic Comput., 2017
2016
A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals.
J. Graph Algorithms Appl., 2016
2015
Hybrid Max-Min ant system with four vertices and three lines inequality for traveling salesman problem.
Soft Comput., 2015
J. Intell. Fuzzy Syst., 2015
Int. J. Comput. Intell. Appl., 2015
Expert Syst. Appl., 2015
2014
The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem.
Comput. Ind. Eng., 2014