Learn 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)
In order to master effectiveness situation of underground coal mine spray and dust reduction, analyze and improve the process of spray and dust reduction which effect is non-ideal, feasibility of introducing process capability analysis as scientific management method was investigated. Measuring tool was analyzed with measurement system analysis which(More)
Bisphenol A (BPA) are commonly used in the manufacture of polycarbonate plastics. Higher BPA exposure levels have been found in patients with endometrial hyperplasia that is one of risk factors of endometrial cancer (EC). Aberrant microRNAs (miRNAs) regulation has been observed in the development of cancer. Thus, this study investigated whether BPA exposure(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