Yan-Yan Tan

Learn More
—The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiob-jective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and(More)
The Traveling Salesman Problem (TSP) belongs to the class of NP-hard optimization problems. Its solving procedure is complicated, especially for large scale problems. In order to solve the large scale TSPs efficiently, this paper presents a bilevel genetic algorithm with clustering (BLGAC). BLGA-C uses a clustering method to divide a large scale TSP into(More)
The 0/1 knapsack problem is a well known problem occurring in many real world problems. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new version of MOEA/D for solving multiobjective 0/1 knapsack problem is proposed in this paper. This(More)
  • 1