This paper uses MapReduce parallel programming mode to make the Ant Colony Optimization (ACO) algorithm parallel and bring forward the MapReduce-based improved ACO for Multi-dimensional Knapsack Problem (MKP). A variety of techniques, such as change the probability calculation of the timing, roulette, crossover and mutation, are applied for improving the drawback of the ACO and complexity of the algorithm is greatly reduced. It is applied to distributed parallel as to solve the large-scale MKP in cloud computing. Simulation experimental results show that the algorithm can improve the defects of long search time for ant colony algorithm and the processing power for large-scale problems.
Based on unconstrained optimization and genetic algorithm, this paper presents a constrained genetic algorithm (CGA) for learning Bayesian network structure. Firstly, an undirected graph is obtained by solving an unconstrained optimization problem. Then based on the undirected graph, the initial population is generated, and selection, crossover and mutation operators are used to learn Bayesian network structure. Since the space of generating the initial population is constituted by some candidate edges of the optimal Bayesian network, the initial population has good property. Compared with the methods which use genetic algorithm (GA) to learn Bayesian network structure directly, the proposed method is more efficiency.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.