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

9th International Conference on Natural Computation (ICNC)

作者： Zhu, Xiaojian Shen, Jun Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781467347143

The minimum energy multicast problem in the wireless ad hoc networks where each node is equipped with a switched-beam directional antenna and has a discretely adjustable transmission rate (MEMDAAR) is discussed. The shuffled frog-leaping algorithm (SFLA) is adopted to solve the MEMDAAR problem. A frog position represents a multicast tree. In the process of using the SFLA to solve the MEMDAAR problem, an invalid frog position is repaired, and a poor frog position is mutated. Simulation results verify the effectiveness of the proposed method.

关键词： multicast directional antennas adaptive rate wireless ad hoc networks shuffled frog-leaping algorithm minimum energy

来源：评论

学校读者我要写书评

暂无评论

A Novel shuffled frog-leaping algorithm for Flexible Job Shop Scheduling with Interval Processing Time 36

A Novel Shuffled Frog-Leaping Algorithm for Flexible Job Sho...

引用

第36届中国控制会议

作者： Deming Lei Sanqiang Cao School of Automation Wuhan University of Technology

ISBN: (纸本)9781538629185

In this study flexible job shop scheduling problem（FJSP） with interval processing times is considered and a novel shuffled frog-leaping algorithm（SFLA） is applied to minimize the maximum interval completion time. Memeplexes are constructed only once and no population shuffling is done. The cooperation of global search and neighborhood search are adopted within the search process of each memeplex. Other strategies such as the handling on the worst solution are also adopted to generate high quality solutions. A new performance metric is used to evaluate interval results. Many experiments are conducted to test the performance of SFLA and computational results show the promising advantages of SFLA on FJSP with interval processing time.

关键词： Flexible job shop scheduling problem Interval processing time shuffled frog-leaping algorithm Uncertainty

来源：评论

学校读者我要写书评

暂无评论

An Effective shuffled frog-leaping algorithm for the Flexible Job-shop Scheduling Problem

An Effective Shuffled Frog-leaping Algorithm for the Flexibl...

引用

3rd IEEE Symposium on Computational Intelligence in Control and Automation (CICA)

作者： Xu, Ye Wang, Ling Wang, Shengyao Tsinghua Univ Dept Automat TNList Beijing 100084 Peoples R China

ISBN: (纸本)9781467358934

As an extension of the classic job-shop scheduling problem (JSP), the flexible job-shop (FJSP) is NP-hard and has a wide application background. In this paper, a shuffled frog-leaping algorithm (SFLA) based algorithm is proposed for solving the FJSP. First, the SFLA employs a hybrid encoding scheme in which two sequences are used to illustrate both operation order sequence and machines assignment. Second, a special bi-level crossover scheme as a local search scheme based on the critical path is incorporated in the framework of the memetic search. The searching ability of the modified SFLA can be well balanced between exploration and exploitation. Furthermore, the influence of the parameter setting is also investigated and suitable parameters are suggested. Numerical simulation and comparisons based on the well-known benchmark problems indicates the effectiveness of the SFLA for solving the problem.

关键词： flexible flow-shop scheduling shuffled frog-leaping algorithm machine assignment operation sequence critical path

来源：评论

学校读者我要写书评

暂无评论

shuffled frog-leaping algorithm for order acceptance and scheduling in flow shop

Shuffled frog-leaping algorithm for order acceptance and sch...

引用

第35届中国控制会议

作者： Deming Lei Xianfeng Tan School of Automation Wuhan University of Technology

ISBN: (纸本)9781509009107

Order acceptance and scheduling problem is considered in a flow shop where the objective is to decide on the orders to accept and schedule the accepted orders so as to maximize total net *** effective shuffled frog-leaping algorithm(SFLA) is proposed,in which population is divided into memeplexes using tournament selection and the search process within each memeplex is done on the best solution of the *** assess the performance of SFLA using an extensive set of *** experimental results show that SFLA can provide the promising results on the considered problems.

关键词： shuffled frog-leaping algorithm flow shop scheduling order acceptance total net revenue

来源：评论

学校读者我要写书评

暂无评论

UAV Path Planning Based on shuffled frog-leaping algorithm and Dubins Path 39

UAV Path Planning Based on Shuffled Frog-Leaping Algorithm a...

引用

39th Chinese Control Conference (CCC)

作者： Li, Xinfang Fang, Yangwang Fu, Wenxing Northwestern Polytech Univ Xian 710072 Peoples R China

ISBN: (数字)9789881563903

ISBN: (纸本)9789881563903

In this paper, a novel path planning algorithm for the fixed-wing UAV based on shuffled frog-leaping algorithm(SFLA) and Dubins path is proposed. First, the Dubins path planning is transformed into a discrete combinatorial optimization problem. Then the SFLA is used to search the optimal Dubins path, so that the generated flight path directly satisfies the minimum turning radius constraint of UAV. In order to perfectly combine the SFLA and the Dubins path, a novel coding method and the worst frog update strategy are presented. Finally, the simulation results prove that the algorithm is effective for path planning of single UAV and multiple UAVs.

关键词： path planning Dubins path shuffled frog-leaping algorithm obstacle avoidance

来源：评论

学校读者我要写书评

暂无评论

Two-Phase shuffled frog-leaping algorithm 3

Two-Phase Shuffled Frog-Leaping Algorithm

引用

International Conference on Reliability, Infocom Technologies and Optimization (ICRITO) (Trends and Future Directions)

作者： Naruka, Bhagyashri Sharma, Tarun K. Pant, Millie Rajpurohit, Jitendra Sharma, Shweta Amity Univ Rajasthan Jaipur Rajasthan India IIT Roorkee Roorkee Uttar Pradesh India

ISBN: (纸本)9781479968961

shuffled frog-leaping algorithm (SFLA) is a recent addition to the stochastic search methods that mimics the social and natural behaviour of species. The basic idea behind modelling of such algorithms is to achieve comparatively better solutions to the multifaceted optimization problems that are not easy to solve using traditional or deterministic mathematical techniques. SFLA combines the advantages of particle swarm optimization (PSO) and genetic algorithm (GA). In this study to improve the convergence speed, two modifications have been proposed firstly, initial population is generated using opposition based learning and secondly search process of SFLA is improved using scaling factor. The proposed algorithm is named as TwoPhase SFLA. The impact of the proposal is illustrated on four structural engineering design problems.

关键词： shuffled frog-leaping algorithm optimization convergence engineering design problems

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Firefly algorithm and shuffled frog-leaping algorithm for Constrained Free and Manufacturing Optimization Problems

A Comparative Study of Firefly Algorithm and Shuffled Frog-l...

引用

2nd International Conference on Frontiers of Mechanical Engineering and Materials Engineering (MEME 2013)

作者： Aungkulanon, Pasura Srikun, Isaree Ruekkasem, Lakkana Phranakorn Rajabhat Univ Fac Ind Technol Bangkok 10220 Thailand

ISBN: (纸本)9783037859247

Manufacturing process problems in industrial systems are currently large and complicated. The effective methods for solving these problems using a finite sequence of instructions can be classified into two groups;optimization and meta-heuristic algorithms. In this paper, a well-known meta-heuristic approach called Firefly algorithm was used to compare with shuffled frog-leaping algorithm. All algorithms were implemented and analyzed with manufacturing process problems under different conditions, which consist of single, multi-peak and curved ridge optimization. The results from both methods revealed that Firefly algorithm seemed to be better in terms of the mean and variance of process yields including design points to achieve the final solution.

关键词： Optimization Meta-Heuristics algorithms Firefly algorithm shuffled frog-leaping algorithm Manufacturing Optimization Problems

来源：评论

学校读者我要写书评

暂无评论

Distributed Energy Sources Management using shuffled frog-leaping algorithm for Optimizing the Environmental and Economic Indices of Smart Microgrid

Distributed Energy Sources Management using Shuffled Frog-Le...

引用

2024 ASU International Conference in Emerging Technologies for Sustainability and Intelligent Systems, ICETSIS 2024

作者： Gouda, Nadia Aly, Hamed H. Dalhousie University Electrical and Computer Engineering Halifax Canada

ISBN: (纸本)9798350372229

When employing renewable energy within a smart micro grid (SMG), the management of distributed energy resources (DER) plays a crucial role in optimizing practical objectives of SMG. This study utilizes the shuffled frog leaping algorithm (SFLA) to manage DER and implement demand response programs (DSP), aiming to optimize economic, technical and environmental problems of SMG. The modeling of renewable energy resources (RES) is a challenge due to its uncertainty, therefore, cumulative distribution function (CDF) is used for predicting the energy sources before its integration with SMG. The DER included in this study consists of the wind and solar energy, battery, micro turbine and the utility. This model is implemented in three different scenarios: a) basic grid operation, b) operation with maximum usage of renewable energy resources, c) operation with maximum usage of RES and DRP. The results obtained show the superiority of proposed SFLA algorithm in terms of avoiding pre-mature convergence which is a common challenge in optimization, and achieving global optimum for the proposed objectives. For validation, this model is implemented in MAT LAB considering different constraints. © 2024 IEEE.

关键词： demand response programs distributed energy sources management renewable energy shuffled frog-leaping algorithm smart grid

来源：评论

学校读者我要写书评

暂无评论

A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem

引用

APPLIED SOFT COMPUTING 2021年 102卷 107085-107085页

作者： Huang, Yao Shen, Xiao-Ning You, Xuan Nanjing Univ Informat Sci & Technol Sch Automat B DAT CICAEET Nanjing 210044 Peoples R China

A discrete shuffled frog-leaping algorithm based on heuristic information is proposed and the traveling salesman problem is used as a test problem. First, a new individual generation operator utilizing the nearest neighbor information is designed. Then, four improved searching strategies are designed to improve the algorithm performance: (1) the opposite roulette selection that makes the candidate solutions participate in the evolution alternately and keeps the population diversity;(2) establishment of an independent elite set which helps to strengthen the exploring ability, balance the searching ability among subgroups and reduce the population assimilation speed;(3) mutation of the local optimal solution in each subgroup which is beneficial to jump out of the local extremum in the search space;and (4) enhancement of the local search on some best solutions in the shuffled population which aims to strengthen the exploiting ability and improve the searching precision. These defined operators make a good balance between exploration and exploitation. Finally, a large number of TSP instances in the open data set TSPLIB are selected to validate the effectiveness of the new individual generation operator and four improved strategies. Comparison results with three classical and six state-of-the-art algorithms indicate that the proposed algorithm can obtain solutions with a higher accuracy and show a better stability. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Traveling salesman problem Combinational optimization shuffled frog-leaping algorithm Heuristic information Population diversity

来源：评论

学校读者我要写书评

暂无评论

Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2020年第0期90卷 103540-000页

作者： Cai, Jingcao Zhou, Rui Lei, Deming Wuhan Univ Technol Sch Automat Wuhan 430070 Peoples R China

Distributed scheduling problems have attracted much attention in recent years;however, distributed hybrid flow shop scheduling problem (DHFSP) is seldom investigated. In this paper, DHFSP with multiprocessor tasks is studied and a dynamic shuffled frog-leaping algorithm (DSFLA) is proposed to minimize makespan. Dynamic search process is executed in each memeplex with at least two improved solutions. Global search and dynamic multiple neighborhood search are applied, in which neighborhood structure is chosen based on its optimization effect. A new destruction-construction process is hybridized with DSFLA and population shuffling is done when shuffling condition is met. Lower bound is obtained and proved. A number of experiments are conducted on a set of instances. The computational results validate the effectiveness of the new strategies of DSFLA and the competitive performances on solving the considered DHFSP.

关键词： Distributed scheduling Hybrid flow shop scheduling Multiprocessor tasks shuffled frog-leaping algorithm Dynamic strategy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：