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

Robust global supply chain network design under disruption and uncertainty considering resilience strategies: A parallel memetic algorithm for a real-life case study

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2016年 87卷 20-52页

作者： Hasani, Aliakbar Khosrojerdi, Amirhossein Univ Shahrood Sch Ind Engn & Management Shahrood Iran Univ Oklahoma Sch Ind & Syst Engn Norman OK 73019 USA

A mixed-integer, non-linear model is developed for designing robust global supply chain networks under uncertainty. Six resilience strategies are proposed to mitigate the risk of correlated disruptions. In addition, an efficient parallel Taguchi-based memetic algorithm is developed that incorporates a customized hybrid parallel adaptive large neighborhood search. Fitness landscape analysis is used to determine an effective selection of neighborhood structures, while the upper bound found by Lagrangian relaxation heuristic is used to evaluate quality of solutions and effectiveness of the proposed metaheuristic. The model is solved for a real-life case of a global medical device manufacturer to extract managerial insights. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Global supply chain network design Robust optimization Resilience strategies Disruption management parallel memetic algorithm Fitness landscape analysis

来源：评论

学校读者我要写书评

暂无评论

Co-operation in the parallel memetic algorithm

引用

INTERNATIONAL JOURNAL OF parallel PROGRAMMING 2015年第5期43卷 812-839页

作者： Nalepa, Jakub Blocho, Miroslaw Silesian Tech Univ Inst Informat PL-44100 Gliwice Poland ABB ISDC PL-04713 Warsaw Poland

Evolutionary algorithms (EAs) have been attracting research attention for last decades. They were shown to be very efficient in solving various complex optimization problems in most fields of science and engineering. In EAs, the population of solutions evolves in time to explore the search space. parallel EAs became an important stream of development due to a wide availability of parallel computer architectures. Thus, designing parallel algorithms utilizing hundreds of CPU cores efficiently is critical nowadays. In this paper, we investigate the impact of selecting a co-operation scheme for the parallel memetic algorithm (PMA-VRPTW) to solve the NP-hard vehicle routing problem with time windows. In the island-model PMA-VRPTW, which is a hybrid of a genetic algorithm applied to explore the search space, and some refinement methods to exploit solutions already found, a number of populations are evolved in parallel. Processes then co-operate and exchange solutions according to the co-operation scheme (migration policy, interval, and topology). Extensive experimental study (which comprised more than 1,584,000 CPU hours on an SMP cluster) performed on 1000-customer Gehring and Homberger's (GH) benchmark tests gave a detailed insight into the PMA-VRPTW performance and search capabilities. We report 19 (32 % of all 1000-customer GH tests) new world's best solutions obtained using the best co-operation schemes. Finally, we give clear and consistent guidelines on how to select a proper co-operation scheme in PMA-VRPTW based on the test characteristics.

关键词： parallel memetic algorithm Island model Co-operation Migration topology Vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

Co-operation Schemes for the parallel memetic algorithm

Co-operation Schemes for the Parallel Memetic Algorithm

引用

10th International Conference on parallel Processing and Applied Mathematics (PPAM)

作者： Nalepa, Jakub Blocho, Miroslaw Czech, Zbigniew J. Silesian Tech Univ Gliwice Poland

ISBN: (纸本)9783642552243

This paper presents a study of co-operation schemes for the parallel memetic algorithm to solve the vehicle routing problem with time windows. In the parallel co-operative search algorithms the processes communicate to exchange the up-to-date solutions, which may guide the search and improve the results. The interactions between processes are defined by the content of the exchanged data, timing, connectivity and mode. We show how co-operation schemes influence the search convergence and solutions quality. The quality of a solution is defined as its proximity to the best, currently-known one. We present the experimental study for the well-known Gehring and Homberger's benchmark. The new world's best solutions obtained in the study confirm that the cooperation scheme has a strong impact on the quality of final solutions.

关键词： parallel memetic algorithm Co-operation scheme Hybrid genetic algorithm Vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

Complexity Analysis of the parallel memetic algorithm for the Pickup and Delivery Problem with Time Windows 5th

Complexity Analysis of the Parallel Memetic Algorithm for th...

引用

5th International Conference on Man-Machine Interactions (ICMMI)

作者： Blocho, Miroslaw Nalepa, Jakub Silesian Tech Univ Gliwice Poland

ISBN: (纸本)9783319677927;9783319677910

Estimating the theoretical complexity of a parallel algorithm can give an impression on how it will perform in practice. However, this complexity analysis is very often omitted in the works from the parallel computation field. In this paper, we theoretically analyze the time complexity of our parallel algorithm for the pickup and delivery problem with time windows (PDPTW), which is an NP-hard discrete optimization task. The PDPTW is a hierarchical objective problem the main objective is to minimize the number of trucks serving the transportation requests, whereas the second objective is to optimize the travel distance. In our approach, the fleet size is optimized using the parallel ejection search, and the distance is minimized using the parallel memetic algorithm. Finally, we report example experimental results showing that our parallel algorithms work very fast in practice.

关键词： Complexity analysis PDPTW parallel memetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A parallel memetic algorithm for the vehicle routing problem with time windows

A parallel memetic algorithm for the vehicle routing problem...

引用

8th International Conference on P2P, parallel, Grid, Cloud and Internet Computing (3PGCIC)

作者： Blocho, Miroslaw Czech, Zbigniew J. Silesian Tech Univ Gliwice Poland

ISBN: (纸本)9780769550947

A parallel memetic algorithm for the NP-hard vehicle routing problem with time windows (VRPTW) is proposed. The algorithm consists of components which are executed as parallel processes. A process runs either a heuristic algorithm or a hybrid of a genetic algorithm and some local refinement procedures. In order to improve the results, processes co-operate periodically using a novel randomized scheme. During each phase of co-operation processes exploit their best solutions found so far. The purpose of the work is to devise the parallel memetic algorithm which determines the VRPTW solutions of the highest possible quality. The experiments on Gehring and Homberger's (GH) benchmarking tests show that the algorithm achieves very good results. By making use of it the best-known solutions to 171 out of 300 Gil tests were improved.

关键词： parallel memetic algorithm parallel processes co-operation schemes genetic and local search algorithms vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

A New parallel memetic algorithm to Knowledge Discovery in Data Mining 2nd

A New Parallel Memetic Algorithm to Knowledge Discovery in D...

引用

2nd International Conference on Swarm Intelligence Based Optimization (ICSIBO)

作者： Oualid, Dahmri Baba-Ali, Ahmed Riadh USTHB FEI Dept Comp Sci BP 32 El Alia Bab Ezzouar Algeria USTHB FEI Res Lab LRPE BP 32 El Alia Bab Ezzouar Algeria

ISBN: (纸本)9783319503073;9783319503066

This paper presents a new parallel memetic algorithm (PMA) for solving the problem of classification in the process of Data Mining. We focus our interest on accelerating the PMA. In most parallel algorithms, the tasks performed by different processors need access to shared data, this creates a need for communication, which in turn slows the performance of the PMA. In this work, we will present the design of our PMA, In which we will use a new replacement approach, which is a hybrid approach that uses both Lamarckian and Baldwinian approaches at the same time, to reduce the quantity of informations exchanged between processors and consequently to improve the speedup of the PMA. An extensive experimental study performed on the UCI Benchmarks proves the efficiency of our PMA. Also, we present the speedup analysis of the PMA.

关键词： parallel memetic algorithm Classification Extraction of rules Lamarckian approach Baldwinian approach Hybridization

来源：评论

学校读者我要写书评

暂无评论

Impact of parallel memetic algorithm Parameters on Its Efficacy

Impact of Parallel Memetic Algorithm Parameters on Its Effic...

引用

11th International Conference on Beyond Databases, Architectures and Structures (BDAS)

作者： Blocho, Miroslaw Nalepa, Jakub Silesian Tech Univ Inst Informat Gliwice Poland ABB ISDC Krakow Poland Future Proc Gliwice Poland

ISBN: (纸本)9783319184227;9783319184210

The vehicle routing problem with time windows (VRPTW) is an NP-hard discrete optimization problem with two objectives-to minimize a number of vehicles serving a set of dispersed customers, and to minimize the total travel distance. Since real-life, commercially-available road network and address databases are very large and complex, approximate methods to tackle the VRPTW became a main stream of development. In this paper, we investigate the impact of selecting two crucial parameters of our parallel memetic algorithm-the population size and the number of children generated for each pair of parents-on its efficacy. Our experimental study performed on selected benchmark problems indicates that the improper selection of the parameters can easily jeopardize the search. We show that larger populations converge to high-quality solutions in a smaller number of consecutive generations, and creating more children helps exploit parents as best as possible.

关键词： parallel memetic algorithm Island model Population size Number of children VRPTW

来源：评论

学校读者我要写书评

暂无评论

AN INVESTIGATION OF parallel memetic algorithmS FOR VLSI CIRCUIT PARTITIONING ON MULTI-CORE COMPUTERS

AN INVESTIGATION OF PARALLEL MEMETIC ALGORITHMS FOR VLSI CIR...

引用

23rd Canadian Conference on Electrical and Computer Engineering (CCECE)

作者： Armstrong, E. Grewal, G. Areibi, S. Darlington, G. Univ Guelph Sch Comp Sci Guelph ON N1G 2W1 Canada Univ Guelph Sch Engn Guelph ON N1G 2W1 Canada Univ Guelph Dept Math & Stat Guelph ON N1G 2W1 Canada

ISBN: (纸本)9781424453771

Circuit-partitioning is one of the most important, but time-consuming steps, in the VLSI design flow. In this paper, we investigate six different parallel memetic algorithms for solving the circuit-partitioning problem. Each parallel implementation uses a global shared-memory to exchange information, and seeks to reduce runtime by exploiting the multiple cores available in today's commodity hardware. When tested with the widely used ACM/SIGDA benchmark suite [16], our empirical results show that near-linear speedups for all six MAs can be achieved, while still producing high-quality solutions.

关键词： VLSI circuit partitioning VLSI design exchange information integrated circuit design microprocessor chips multicore computers parallel memetic algorithm parallel processing shared memory systems shared-memory system

来源：评论

学校读者我要写书评

暂无评论

Review on parallel Evolutionary Computing and Introduce Three General Framework to parallelize All EC algorithms

Review on Parallel Evolutionary Computing and Introduce Thre...

引用

5th Conference on Information and Knowledge Technology (IKT)

作者： Majd, Amin Lotfi, Shahriar Sahebi, Golnaz Tabriz Univ Aras Int Campus Tabriz Iran Tabriz Univ Dept Comp Sci Tabriz Iran

ISBN: (纸本)9781467364904;9781467364898

Optimization and solving NP-hard problem are very important and Evolutionary Computing methods are useful and popular. There are different types of EC methods that most of them are serial and some other one has parallel implementation. In first step we want review some parallel implementation of EC methods and in second step we introduce three general frame work to parallelize all serial EC methods.

关键词： component parallel Genetic algorithms parallel PSO parallel Ant Optimization Colony parallel Bee Colony Optimization parallel memetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：