scholarly journals Coarse-grained parallel genetic algorithm applied to a vector based land use allocation optimization problem: the case study of Tongzhou Newtown, Beijing, China

2012 ◽  
Vol 27 (5) ◽  
pp. 1133-1142 ◽  
Author(s):  
Kai Cao ◽  
Xinyue Ye
Keyword(s):  
Genetic Algorithm ◽  
Land Use ◽  
Optimization Problem ◽  
Coarse Grained ◽  
Parallel Genetic Algorithm ◽  
Land Use Allocation ◽  
Beijing China

scholarly journals Spatial Multi-Objective Land Use Optimization toward Livability Based on Boundary-Based Genetic Algorithm: A Case Study in Singapore

2020 ◽  
Vol 9 (1) ◽  
pp. 40 ◽  
Author(s):  
Kai Cao ◽  
Muyang Liu ◽  
Shu Wang ◽  
Mengqi Liu ◽  
Wenting Zhang ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Land Use ◽  
Central Region ◽  
Optimization Model ◽  
Optimization Problem ◽  
Weighted Sum ◽  
Multi Objective ◽  
Land Use Optimization ◽  
Future Direction

In this research, the concept of livability has been quantitatively and comprehensively reviewed and interpreted to contribute to spatial multi-objective land use optimization modelling. In addition, a multi-objective land use optimization model was constructed using goal programming and a weighted-sum approach, followed by a boundary-based genetic algorithm adapted to help address the spatial multi-objective land use optimization problem. Furthermore, the model is successfully and effectively applied to the case study in the Central Region of Queenstown Planning Area of Singapore towards livability. In the case study, the experiments based on equal weights and experiments based on different weights combination have been successfully conducted, which can demonstrate the effectiveness of the spatial multi-objective land use optimization model developed in this research as well as the robustness and reliability of computer-generated solutions. In addition, the comparison between the computer-generated solutions and the two real planned scenarios has also clearly demonstrated that our generated solutions are much better in terms of fitness values. Lastly, the limitation and future direction of this research have been discussed.

scholarly journals The application of Coarse-Grained Parallel Genetic Algorithm with Hadoop in University Intelligent Course-Timetabling System

2015 ◽  
Vol 10 (8) ◽  
pp. 11
Author(s):  
Liping Wu
Keyword(s):  
Genetic Algorithm ◽  
Educational Administration ◽  
Coarse Grained ◽  
Map Reduce ◽  
Parallel Genetic Algorithm ◽  
Course Timetabling ◽  
Timetabling Problem ◽  
University Course Timetabling ◽  
Course Timetabling Problem ◽  
University Course

The university course-timetabling problem is a NP-C problem. The traditional method of arranging course is inefficient, causes a high conflict rate of teacher resource or classroom resource, and is poor satisfaction in students. So it does not meet the requirements of modern university educational administration management. However, parallel genetic algorithm (PGA) not only have the advantages of the traditional genetic algorithm(GA), but also take full advantage of the computing power of parallel computing. It can improve the quality and speed of solving effectively, and have a broad application prospect in solving the problem of university course-timetabling problem. In this paper, based on the cloud computing platform of Hadoop, an improved method of fusing coarse-grained parallel genetic algorithm (CGPGA) and Map/Reduce programming model is deeply researched, and which is used to solve the problem of university intelligent courses arrangement. The simulation experiment results show that, compared with the traditional genetic algorithm, the coarse-grained parallel genetic algorithm not only improves the efficiency of the course arrangement and the success rate of the course, but also reduces the conflict rate of the course. At the same time, this research makes full use of the high parallelism of Map/Reduce to improve the efficiency of the algorithm, and also solves the problem of university scheduling problem more effectively.

scholarly journals A Parallel Genetic Algorithm Based Feature Selection and Parameter Optimization for Support Vector Machine

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi Chen ◽  
Tao Lin ◽  
Ningjiu Tang ◽  
Xin Xia
Keyword(s):  
Genetic Algorithm ◽  
Classification Accuracy ◽  
Coarse Grained ◽  
Support Vector ◽  
Svm Classifier ◽  
Feature Subset ◽  
Parallel Genetic Algorithm ◽  
Support Vectors ◽  
Optimal Feature Subset ◽  
Optimal Feature

The extensive applications of support vector machines (SVMs) require efficient method of constructing a SVM classifier with high classification ability. The performance of SVM crucially depends on whether optimal feature subset and parameter of SVM can be efficiently obtained. In this paper, a coarse-grained parallel genetic algorithm (CGPGA) is used to simultaneously optimize the feature subset and parameters for SVM. The distributed topology and migration policy of CGPGA can help find optimal feature subset and parameters for SVM in significantly shorter time, so as to increase the quality of solution found. In addition, a new fitness function, which combines the classification accuracy obtained from bootstrap method, the number of chosen features, and the number of support vectors, is proposed to lead the search of CGPGA to the direction of optimal generalization error. Experiment results on 12 benchmark datasets show that our proposed approach outperforms genetic algorithm (GA) based method and grid search method in terms of classification accuracy, number of chosen features, number of support vectors, and running time.

Sign in / Sign up

Export Citation Format

Share Document