1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2019
A Heuristic Algorithm Based on Tour Rebuilding Operator for the Traveling Salesman Problem
Yang Li, Junbin Gao, Mingyuan Bai +2
TSP (Traveling Salesman Problem), a classic NP-complete problem in combinatorial optimization, is of great significance in multiple fields. Exact algorithms for TSP are not practic…
cs.DB2019★ 1 cited
Efficient Spatial Nearest Neighbor Queries Based on Multi-layer Voronoi Diagrams
Yang Li, Gang Liu, Junbin Gao +3
Nearest neighbor (NN) problem is an important scientific problem. The NN query, to find the closest one to a given query point among a set of points, is widely used in applications…
cs.NE2017★ 1 cited
Subpopulation Diversity Based Selecting Migration Moment in Distributed Evolutionary Algorithms
Chengjun Li, Jia Wu
In distributed evolutionary algorithms, migration interval is used to decide migration moments. Nevertheless, migration moments predetermined by intervals cannot match the dynamic…