检索结果-内蒙古大学图书馆

A parallel genetic algorithm to solve the set-covering problem

COMPUTERS & OPERATIONS RESEARCH 2002年第9期29卷 1221-1235页

作者： Solar, M Parada, V Urrutia, R Univ Santiago Chile Dept Ingn Informat Santiago Chile

This work presents a parallel genetic algorithm (PGA) model to solve the set-covering problem (SCP). Experimental results obtained with a binary,. representation of the SCP, show that-in terms of the number of generations (computational time) needed to achieve solutions of an acceptable quality-PGA performs better than the sequential model. This comportment can be explained principally because. the PGA of p nodes-each one with its corresponding local population P-L-behaves like a sequential GA with a global population, P-G, of the same size, which it-the sequential GA-has the great disadvantage of having to completely evaluate in each generation. Not so the PGA, which only evaluates a pth part of the P-G.

关键词： set-covering problem parallel genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An accurate parallel genetic algorithm to schedule tasks on a cluster

引用

parallel COMPUTING 2004年第5-6期30卷 567-583页

作者： Moore, M Texas A&M Univ Dept Math & Comp Sci Corpus Christi TX 78412 USA

Recent breakthroughs in the mathematical estimation of parallel genetic algorithm parameters are applied to the NP-complete problem of scheduling multiple tasks on a cluster of computers connected by a shared bus. Numerous adjustments to the original method of parameter estimation were made in order to accurately reflect differences in the problem model. The parallel scheduler used m-ary encoding and included a shared communication bus constraint. Fitness was an indirect computation requiring an evaluation of the meaning and implications (i.e., effect on communication time) of the encoding. The degree of correctness was defined as the "nearness" to the optimal schedule that could be obtained in a limited amount of time. Experiments reveal that the parallel scheduling algorithm developed very accurate schedules when the modified parameter guidelines were used. This article describes the scheduling problem, the parallel genetic scheduler, the adjustments made to the mathematical estimations, the quality of the schedules that were obtained, and the accuracy of the schedules compared to mathematically predicted expected values. (C) 2004 Elsevier B.V. All rights reserved.

关键词： clusters genetic algorithms scheduling parallel genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A study of five parallel approaches to a genetic algorithm for the traveling salesman problem

引用

INTELLIGENT AUTOMATION AND SOFT COMPUTING 2005年第4期11卷 217-234页

作者： Wang, L Maciejewski, AA Siegel, HJ Roychowdhury, VP Eldridge, BD Microsoft Corp Redmond WA 98052 USA Colorado State Univ Dept Elect & Comp Engn Ft Collins CO 80526 USA Colorado State Univ Dept Comp Sci Ft Collins CO 80526 USA Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

This paper presents a comparative study of five different coarse-grained parallel genetic algorithms (PGAs) using the traveling salesman problem as the case application. All of these PGAs are based on the same baseline serial genetic algorithm, implemented on the same parallel machine (IBM SP2), tested on the same problem instances, and started from the same set of initial populations. Based on these experiments, a PGA that combines a new subtour technique with a known migration approach is identified to be the best for the traveling salesman problem among the five PGAs being compared.

关键词： parallel genetic algorithms traveling salesman problem memetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A parallel genetic algorithm for identifying faults in large diagnosable systems

引用

INTERNATIONAL JOURNAL OF parallel EMERGENT AND DISTRIBUTED SYSTEMS 2005年第2期20卷 113-125页

作者： Elhadef, Mourad Das, Shantanu Nayak, Amiya Univ Ottawa Sch Informat Technol & Engn Ottawa ON Canada

This paper deals with the problem of fault identification in large diagnosable systems under the PMC model. Recently, genetic algorithms have been successfully used to solve this system-level fault diagnosis problem;however, they have one major drawback, i.e. even though they have been shown to perform better than the existing diagnosis algorithms, they are still time-consuming especially for large systems composed of hundreds or thousands of nodes. In this paper, we describe a new parallel version of the existing evolutionary diagnosis algorithm, which exploits competing sub-populations to speed up the diagnosis algorithm. The new approach has been implemented using the parallel virtual machine (PVM) environment and has been evaluated on a workstation network using randomly generated large diagnosable systems. Experimental results showed that the new parallel version considerably improved the response time of the diagnosis algorithm, hence, allowing for fast identification of faulty nodes.

关键词： Fault tolerance System-level fault diagnosis Test assignment t-Diagnosable systems parallel genetic algorithms parallel virtual machine (PVM)

来源：评论

学校读者我要写书评

暂无评论

Probabilistic diagnosis of large systems using a parallel genetic approach

Probabilistic diagnosis of large systems using a parallel ge...

引用

International Conference on parallel and Distributed Processing Techniques and Applications

作者： Elhadef, M Abrougui, K Das, S Nayak, A Univ Ottawa Sch Informat Technol & Engn Ottawa ON Canada

ISBN: (纸本)1932415610

In this paper, we present a system-level fault identification algorithm, using a parallel genetic algorithm, for diagnosing faulty nodes in large heterogeneous systems. The algorithm is based on a probabilistic model where individual node fails with an a priori probability p. The assumptions concerning test outcomes are the same as in the PMC model, that is, fault-free testers always give correct test outcomes and faulty testers are totally unpredictable. The parallel diagnosis algorithm was implemented and simulated on randomly generated large systems. Simulations results are provided showing that the parallel diagnosis did improve the efficiency of the evolutionary diagnosis approach, in that it allowed faster diagnosis of faulty situation, making it a contribution to present techniques.

关键词： multiprocessor systems system-level diagnosis probabilistic diagnosis fault tolerance parallel genetic algorithms parallel virtual machine (PVM)

来源：评论

学校读者我要写书评

暂无评论

Discovering Interesting Rules from Biological Data Using parallel genetic Algorithm

Discovering Interesting Rules from Biological Data Using Par...

引用

3rd IEEE International Advance Computing Conference (IACC)

作者： Dash, Satya Ranjan Dehuri, Satchidananda Rayaguru, Susil KIIT Univ Sch Comp Applicat Bhubaneswar 751024 Odisha India Ajou Univ Dept Syst Engn Suwon 443749 South Korea

ISBN: (纸本)9781467345286

In this paper, a parallel genetic based association rule mining method is proposed to discover interesting rules from a large biological database. Apriori algorithms and its variants for association rule mining rely on two user specified threshold parameters such as minimum support and minimum confidence which is obviously an issue to be resolved. In addition, there are other issues like large search space and local optimality attracts many researchers to use heuristic mechanism. In the presence of large biological databases and with an aim to circumvent these problems, genetic algorithm may be taken as a suitable tool, but its computational cost is the main bottle-neck. Therefore, we choose parallel genetic algorithms to get relief from the pain of computational cost. The experimental result is promising and encouraging to do further research especially in the domain of biological science.

关键词： Apriori algorithm genetic algorithm parallel genetic algorithms Association rule mining Data mining

来源：评论

学校读者我要写书评

暂无评论

parallel genetic algorithm for VLSI building block layout

Parallel genetic algorithm for VLSI building block layout

引用

2nd IEEE International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2006)

作者： Xu, Ning Huang, Feng Jiang, Zhonghua Wuhan Univ Technol Wuhan 430070 Peoples R China

ISBN: (纸本)9781424405169

The VLSI building block layout(BBL) becomes a more and more important problem for VLSI physical design. In this paper, A Multithread scheme for parallelizing a genetic algorithm for BBL placement optimization is presented. The parallel genetic algorithms(PGA) are realized, using sequence-pair(SP) as the representation. parallel. algorithm can be used either to speed up a problem or to achieve a higher accuracy of solutions to a problem. Our experimental results on a SUN workstation with 4 CPUs have shown that the scheme is effective in improving performance of placement over that of a sequential implementation.

关键词： building block layout parallel genetic algorithms physical design

来源：评论

学校读者我要写书评

暂无评论

A Multi-GPU parallel genetic Algorithm For Large-Scale Vehicle Routing Problems

A Multi-GPU Parallel Genetic Algorithm For Large-Scale Vehic...

引用

IEEE High Performance Extreme Computing Virtual Conference (HPEC)

作者： Abdelatti, Marwan Sodhi, Manbir Sendag, Resit Univ Rhode Isl Ind & Mech Engn Kingston RI 02881 USA Univ Rhode Isl Elect & Comp Engn Kingston RI 02881 USA

ISBN: (数字)9781665497862

ISBN: (纸本)9781665497862

The Vehicle Routing Problem (VRP) is fundamental to logistics operations. Finding optimal solutions for VRPs related to large, real-world operations is computationally expensive. genetic algorithms (GA) have been used to find good solutions for different types of VRPs but are slow to converge. This work utilizes high-performance computing (HPC) platforms to design a parallel GA (PGA) algorithm for solving large-scale VRP problems. The algorithm is implemented on an eight-GPU NVIDIA DGX-1 server. Maximum parallelism is achieved by mapping all algorithm arrays into block threads to achieve high throughput and reduced latency for full GPU utilization. Tests with VRP benchmark problems of up to 20,000 nodes compare the algorithm performance (speed) with different GPU counts and a multi-CPU implementation. The developed algorithm provides the following improvements over CPU or single-GPUbased algorithms: (i) larger problem sizes up to 20,000 nodes are handled, (ii) execution time is reduced over the CPU by a factor of 1,700, and iii) for the range tested, the performance increases monotonically with the number of GPUs.

关键词： multi-GPU parallelization parallel genetic algorithms local search vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

A parallel Hybrid genetic Algorithm-Simulated Annealing for Solving Q3AP on Computational Grid

A Parallel Hybrid Genetic Algorithm-Simulated Annealing for ...

引用

23rd IEEE International parallel and Distributed Processing Symposium

作者： Loukil, Lakhdar Mehdi, Malika Melab, Nouredine Talbi, El-Ghazali Bouvry, Pascal Univ Oran Fac Sci Dept Informat BP 1524 El Mnaouer Oran Algeria Univ Luxembourg Fac Sci Technol & Commun L-1359 Luxembourg Luxembourg INRIA Futurs F-59650 Villeneuve Dascq France

ISBN: (纸本)9781424437511

In this paper we propose a parallel hybrid genetic method for solving Quadratic 3-dimensional Assignment Problem (Q3AP). This problem is proved to be computationally NP-hard. The parallelism in our algorithm is of two hierarchical levels. The first level is an insular model where a number of GAs (genetic algorithms) evolve in parallel. The second level is a parallel transformation of individuals in each GA. Implementation has been done using ParadisEO(1) framework, and the experiment., have been performed on GRID5000, the French nation-wide computational grid. To evaluate our method, we used three benchmarks derived from QAP instances of QAPLIB and the results are compared with those reported in the literature. The preliminary results show that the method is promising. The obtained solutions are close to the optimal values and the execution is efficient.

关键词： Quadratic 3-dimensional Assignment Problem Meta-heuristics Insular Model Hybridization parallel genetic algorithms Grid Computing

来源：评论

学校读者我要写书评

暂无评论

Topological Effects on the Performance of Island Model of parallel genetic Algorithm

Topological Effects on the Performance of Island Model of Pa...

引用

12th International Work-Conference on Artificial Neural Networks (IWANN)

作者： Guan, Wang Szeto, Kwok Yip Hong Kong Univ Sci & Technol Dept Phys Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9783642386817

The topological features of the communication network between computing nodes in parallel genetic algorithms, under the framework of the island model, is discussed in the context of both the local rate of information exchange between nodes, and the global exchange rate that measures the level of information flow in the entire network. For optimal performance of parallel genetic algorithm for a set of benchmark functions, the connectivity of the network can be found, corresponding to a global information exchange rate between 40-70%. This range is obtained by statistical analysis on the search for solutions of four benchmark problems: the 0-1 knapsack, the Weierstrass's function, the Ackley's function, and the Modified Shekel's foxholes function. Our method is based on the cutting of links of a fully connected network to gradually decrease the connectivity, and compare the performance of the genetic algorithm on each network. Suggestions for the protocol in applying this general guideline in the design of a good communication network for parallel genetic algorithms are made, where the islands are connected with 40% of links of a fully connected network before fine tuning the parameters of the island model to enhance performance in a specific problem.

关键词： parallel genetic algorithms Island Model Network Information Exchange Connectivity Non-separable Function Optimization Knapsack

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：