According to the size of the projector function to evaluate the merits of the program, Projection Pursuit method is applied to real estate investment decision-making by using the real coding based on Accelerating Gene...According to the size of the projector function to evaluate the merits of the program, Projection Pursuit method is applied to real estate investment decision-making by using the real coding based on Accelerating Genetic Algorithm (RAGA) to optimize the Projection Pursuit Classification (PPC) process and a wide range of indicators value was projected linearly. The results are reasonable and verified with an example. At the same time, the subjective of the target weight can be avoided. It provides decision-makers with comprehensive information on all the indicators of new ideas and new展开更多
In order to solve the premature convergence problem of the basic Ant Colony Optimization algorithm, a promising modification with changing index was proposed. The main idea of the modification is to measure the uncert...In order to solve the premature convergence problem of the basic Ant Colony Optimization algorithm, a promising modification with changing index was proposed. The main idea of the modification is to measure the uncertainty of the path selection and evolution by using the average information entropy self-adaptively. Simulation study and perform-ance comparison on Traveling Salesman Problem show that the improved algorithm can converge at the global opti-mum with a high probability. The work provides a new approach for solving the combinatorial optimization problems, especially the NP-hard combinatorial optimization problems.展开更多
文摘According to the size of the projector function to evaluate the merits of the program, Projection Pursuit method is applied to real estate investment decision-making by using the real coding based on Accelerating Genetic Algorithm (RAGA) to optimize the Projection Pursuit Classification (PPC) process and a wide range of indicators value was projected linearly. The results are reasonable and verified with an example. At the same time, the subjective of the target weight can be avoided. It provides decision-makers with comprehensive information on all the indicators of new ideas and new
文摘In order to solve the premature convergence problem of the basic Ant Colony Optimization algorithm, a promising modification with changing index was proposed. The main idea of the modification is to measure the uncertainty of the path selection and evolution by using the average information entropy self-adaptively. Simulation study and perform-ance comparison on Traveling Salesman Problem show that the improved algorithm can converge at the global opti-mum with a high probability. The work provides a new approach for solving the combinatorial optimization problems, especially the NP-hard combinatorial optimization problems.
