检索结果-南通市图书馆

Quantum-Inspired Distributed memetic algorithm

Complex System Modeling and Simulation 2022年第4期2卷 334-353页

作者： Guanghui Zhang Wenjing Ma Keyi Xing Lining Xing Kesheng Wang the School of Information Science and Technology and the Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China the School of Information Science and Technology Hebei Agricultural UniversityBaoding 071001China. the State Key Laboratory for Manufacturing System Engineering and the Systems Engineering Institute Xi’an Jiaotong UniversityXi’an 710049China the School of Electronic Xidian UniversityXi’an 710071China the Department of Production and Quality Engineering Norwegian University of Science and TechnologyTrondheim 7491Norway

This paper proposed a novel distributed memetic evolutionary model,where four modules distributed exploration,intensified exploitation,knowledge transfer,and evolutionary restart are coevolved to maximize their strengths and achieve superior global optimality.Distributed exploration evolves three independent populations by heterogenous operators.Intensified exploitation evolves an external elite archive in parallel with exploration to balance global and local searches.Knowledge transfer is based on a point-ring communication topology to share successful experiences among distinct search agents.Evolutionary restart adopts an adaptive perturbation strategy to control search diversity reasonably.Quantum computation is a newly emerging technique,which has powerful computing power and parallelized ability.Therefore,this paper further fuses quantum mechanisms into the proposed evolutionary model to build a new evolutionary algorithm,referred to as quantum-inspired distributed memetic algorithm(QDMA).In QDMA,individuals are represented by the quantum characteristics and evolved by the quantum-inspired evolutionary optimizers in the quantum hyperspace.The QDMA integrates the superiorities of distributed,memetic,and quantum evolution.Computational experiments are carried out to evaluate the superior performance of QDMA.The results demonstrate the effectiveness of special designs and show that QDMA has greater superiority compared to the compared state-of-the-art algorithms based on Wilcoxon’s rank-sum test.The superiority is attributed not only to good cooperative coevolution of distributed memetic evolutionary model,but also to superior designs of each special component.

关键词： distributed evolutionary algorithm memetic algorithm quantum-inspired evolutionary algorithm quantum distributed memetic algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Optimal Scheduling Method of Cogeneration System with Heat Storage Device Based on memetic algorithm

引用

Energy Engineering 2023年第2期120卷 317-343页

作者： Haibo Li YibaoWang Xinfu Pang Wei Liu Xu Zhang Key Laboratory of Energy Saving and Controlling in Power Systemof Liaoning Province Shenyang Institute of EngineeringShenyang110136China Jinzhou Power Supply Company State Grid Liaoning Electric Power Co.Ltd.Jinzhou121009China

Electric-heat coupling characteristics of a cogeneration system and the operating mode of fixing electricity with heat are the main reasons for wind abandonment during the heating season in the Three North area.To improve the wind-power absorption capacity and operating economy of the system,the structure of the system is improved by adding a heat storage device and an electric boiler.First,aiming at the minimum operating cost of the system,the optimal scheduling model of the cogeneration system,including a heat storage device and electric boiler,is constructed.Second,according to the characteristics of the problem,a cultural gene algorithm program is compiled to simulate the calculation example.Finally,through the system improvement,the comparison between the conditions before and after and the simulation solutions of similar algorithms prove the effectiveness of the proposed scheme.The simulation results show that adding the heat storage device and electric boiler to the scheduling optimization process not only improves the wind power consumption capacity of the cogeneration system but also reduces the operating cost of the system by significantly reducing the coal consumption of the unit and improving the economy of the system operation.The cultural gene algorithm framework has both the global evolution process of the population and the local search for the characteristics of the problem,which has a better optimization effect on the solution.

关键词： Combined heat and power generation heat storage device memetic algorithm simulated annealing wind abandonment

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Efficient Clustering Using memetic Adaptive Hill Climbing algorithm in WSN

引用

Intelligent Automation & Soft Computing 2023年第3期35卷 3169-3185页

作者： M.Manikandan S.Sakthivel V.Vivekanandhan Department of Computer Science and Engineering Adhiyamaan College of EngineeringHosur635109TamilnaduIndia Department of Computer Science and Engineering Sona College of TechnologySalem636005TamilnaduIndia

Wireless Sensor Networks are composed of autonomous sensing devices which are interconnected to form a closed network.This closed network is intended to share sensitive location-centric information from a source node to the base station through efﬁcient routing mechanisms.The efﬁciency of the sensor node is energy bounded,acts as a concentrated area for most researchers to offer a solution for the early draining power of sensors.Network management plays a signiﬁcant role in wireless sensor networks,which was obsessed with the factors like the reliability of the network,resource management,energy-efﬁcient routing,and scalability of services.The topology of the wireless sensor networks acts dri-ven factor for network efﬁciency which can be effectively maintained by perform-ing the clustering process effectively.More solutions and clustering algorithms have been offered by various researchers,but the concern of reduced efﬁciency in the routing process and network management still exists.This research paper offers a hybrid algorithm composed of a memetic algorithm which is an enhanced version of a genetic algorithm integrated with the adaptive hill-climbing algorithm for performing energy-efﬁcient clustering process in the wireless sensor networks.The memetic algorithm employs a local searching methodology to mitigate the premature convergence,while the adaptive hill-climbing algorithm is a local search algorithm that persistently migrates towards the increased elevation to determine the peak of the mountain(i.e.,)best cluster head in the wireless sensor networks.The proposed hybrid algorithm is compared with the state of art clus-tering algorithm to prove that the proposed algorithm outperforms in terms of a network life-time,energy consumption,throughput,etc.

关键词： Wireless sensor networks topology clustering memetic algorithm adaptive hill climbing algorithm network management energy consumption throughput

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

引用

Chinese Journal of Aeronautics 2014年第3期27卷 622-633页

作者： Zhang Xing Chen Jie Xin Bin Peng Zhihong School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

The problem of generating optimal paths for curvature-constrained unmanned aerial vehicles （UAVs） performing surveillance of multiple ground targets is addressed in this paper. UAVs are modeled as Dubins vehicles so that the constraints of UAVs＇ minimal turning radius can be taken into account. In view of the effective surveillance range of the sensors equipped on UAVs, the problem is formulated as a Dubins traveling salesman problem with neighborhood （DTSPN）. Considering its prohibitively high computational complexity, the Dubins paths in the sense of terminal heading relaxation are introduced to simplify the calculation of the Dubins distance, and a boundary-based encoding scheme is proposed to determine the visiting point of every target neighborhood. Then, an evolutionary algorithm is used to derive the optimal Dubins tour. To further enhance the quality of the solutions, a local search strategy based on approximate gradient is employed to improve the visiting points of target neighborhoods. Finally, by a minor modification to the individual encoding, the algorithm is easily extended to deal with other two more sophisticated DTSPN variants （multi-UAV scenario and multiple groups of targets scenario）. The performance of the algorithm is demonstrated through comparative experiments with other two state-of-the-art DTSPN algorithms identified in literature. Numerical simulations exhibit that the algorithm proposed in this paper can find high-quality solutions to the DTSPN with lower computational cost and produce significantly improved performance over the other algorithms.

关键词： Approximate gradient Dubins traveling salesmanproblem with neighborhood Local search memetic algorithm Unmanned aerial vehicles

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Identifying vital edges in Chinese air route network via memetic algorithm

引用

Chinese Journal of Aeronautics 2017年第1期30卷 330-336页

作者： Du Wenbo Liang Boyuan Yan Gang Oriol Lordan Cao Xianbin School of Electronic and Information Engineering Beihang University Beijing 100191 China Beijing Key Laboratory for Network-based Cooperative Air Traffic Management Beijing 100191 China School of Physics Science and Engineering Tongji University Shanghai 200092 China Universitat Politecnica de Catalunya-BarcelonaTech C/Colom no. 11 Terrassa 08222 Spain

Due to rapid development in the past decade, air transportation system has attracted considerable research attention from diverse communities. While most of the previous studies focused on airline networks, here we systematically explore the robustness of the Chinese air route network, and identify the vital edges which form the backbone of Chinese air transportation system.Specifically, we employ a memetic algorithm to minimize the network robustness after removing certain edges, and hence the solution of this model is the set of vital edges. Counterintuitively,our results show that the most vital edges are not necessarily the edges of the highest topological importance, for which we provide an extensive explanation from the microscope view. Our findings also offer new insights to understanding and optimizing other real-world network systems.

关键词： Air route network Air transport network memetic algorithm Robustness Vital edges

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

UAV search-and-rescue planning using an adaptive memetic algorithm

引用

Frontiers of Information Technology & Electronic Engineering 2021年第11期22卷 1477-1491页

作者： Libin HONG Yue WANG Yichen DU Xin CHEN Yujun ZHENG School of Information Science and Technology Hangzhou Normal UniversityHangzhou311121China College of Computer Science and Technology Zhejiang University of TechnologyHangzhou310023China

The use of unmanned aerial vehicles(UAVs) is becoming more commonplace in search-and-rescue tasks,but UAV search planning can be very complex due to limited response time, large search area, and multiple candidate search modes. In this paper, we present a UAV search planning problem where the search area is divided into a set of subareas and each subarea has a prior probability that the target is present in it. The problem aims to determine the search sequence of the subareas and the search mode for each subarea to maximize the probability of finding the target. We propose an adaptive memetic algorithm that combines a genetic algorithm with a set of local search procedures and dynamically determines which procedure to apply based on the past performance of the procedures measured in fitness improvement and diversity improvement during problem-solving. Computational experiments show that the proposed algorithm exhibits competitive performance compared to a set of state-of-the-art global search heuristics, non-adaptive memetic algorithms, and adaptive memetic algorithms on a wide set of problem instances.

关键词： memetic algorithm Self-adaptive Unmanned aerial vehicle(UAV) Search-and-rescue

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Dual-Objective Mixed Integer Linear Program and memetic algorithm for an Industrial Group Scheduling Problem

引用

IEEE/CAA Journal of Automatica Sinica 2021年第6期8卷 1199-1209页

作者： Ziyan Zhao Shixin Liu MengChu Zhou Abdullah Abusorrah State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engineering Northeastern UniversityShenyang 110819China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102 USA Center of Research Excellence in Renewable Energy and Power Systems King Abdulaziz UniversityJeddah 21481Saudi Arabia Department of Electrical and Computer Engineering Faculty of Engineeringand Center of Research Excellence in Renewable Energy and Power SystemsKing Abdulaziz UniversityJeddah 21481Saudi Arabia

Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due time.It is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production systems.Two objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the problem.To obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy algorithm.The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers.Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.

关键词： Insertion-based local search iterated greedy algorithm machine learning memetic algorithm nondominated sorting genetic algorithm II(NSGA-II) production scheduling

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A strategic flight conflict avoidance approach based on a memetic algorithm

引用

Chinese Journal of Aeronautics 2014年第1期27卷 93-101页

作者： Guan Xiangmin Zhang Xuejun Han Dong Zhu Yanbo Lv Ji Su Jing School of Electronic and Information Engineering Beihang University National Key Laboratory of CNS/ATM Beihang University Aviation Data Communication Corporation

Conflict avoidance （CA） plays a crucial role in guaranteeing the airspace safety. The cur- rent approaches, mostly focusing on a short-term situation which eliminates conflicts via local adjust- ment, cannot provide a global solution. Recently, long-term conflict avoidance approaches, which are proposed to provide solutions via strategically planning traffic flow from a global view, have attracted more attentions. With consideration of the situation in China, there are thousands of flights per day and the air route network is large and complex, which makes the long-term problem to be a large-scale combinatorial optimization problem with complex constraints. To minimize the risk of premature convergence being faced by current approaches and obtain higher quality solutions, in this work, we present an effective strategic framework based on a memetic algorithm （MA）, which can markedly improve search capability via a combination of population-based global search and local improve- ments made by individuals. In addition, a specially designed local search operator and an adaptive local search frequency strategy are proposed to improve the solution quality. Furthermore, a fast genetic algorithm （GA） is presented as the global optimization method. Empirical studies using real traffic data of the Chinese air route network and daily flight plans show that our approach outper- formed the existing approaches including the GA .based approach and the cooperative coevolution based approach as well as some well-known memetic algorithm based approaches.

关键词： Air traffic control Combinatorial optimization Conflict avoidance Genetic algorithm memetic algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Data-Driven Heuristic Assisted memetic algorithm for Efficient Inter-Satellite Link Scheduling in the BeiDou Navigation Satellite System

引用

IEEE/CAA Journal of Automatica Sinica 2021年第11期8卷 1800-1816页

作者： Yonghao Du Ling Wang Lining Xing Jungang Yan Mengsi Cai College of Systems Engineering National University of Defense TechnologyChangsha 410073China Leiden Institute of Advanced Computer Science Leiden UniversityLeiden 2332 CAThe Netherlands Department of Automation Tsinghua UniversityBeijing 100083China

Inter-satellite link(ISL)scheduling is required by the BeiDou Navigation Satellite System(BDS)to guarantee the system ranging and communication performance.In the BDS,a great number of ISL scheduling instances must be addressed every day,which will certainly spend a lot of time via normal metaheuristics and hardly meet the quick-response requirements that often occur in real-world applications.To address the dual requirements of normal and quick-response ISL schedulings,a data-driven heuristic assisted memetic algorithm(DHMA)is proposed in this paper,which includes a high-performance memetic algorithm(MA)and a data-driven heuristic.In normal situations,the high-performance MA that hybridizes parallelism,competition,and evolution strategies is performed for high-quality ISL scheduling solutions over time.When in quick-response situations,the data-driven heuristic is performed to quickly schedule high-probability ISLs according to a prediction model,which is trained from the high-quality MA solutions.The main idea of the DHMA is to address normal and quick-response schedulings separately,while high-quality normal scheduling data are trained for quick-response use.In addition,this paper also presents an easy-to-understand ISL scheduling model and its NP-completeness.A seven-day experimental study with 10080 one-minute ISL scheduling instances shows the efficient performance of the DHMA in addressing the ISL scheduling in normal(in 84 hours)and quick-response(in 0.62 hour)situations,which can well meet the dual scheduling requirements in real-world BDS applications.

关键词： BeiDou Navigation Satellite System(BDS) data-driven heuristic inter-satellite link(ISL)scheduling memetic algorithm metaheuristic quick-response

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A memetic algorithm based on hyper-heuristics for examination timetabling problems

引用

International Journal of Intelligent Computing and Cybernetics 2015年第2期8卷 139-151页

作者： Yu Lei Maoguo Gong Licheng Jiao Yi Zuo Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education International Research Center for Intelligent Perception and ComputationXidian UniversityXi’anChina

Purpose–The examination timetabling problem is an NP-hard problem.A large number of approaches for this problem are developed to find more appropriate search strategies.Hyper-heuristic is a kind of representative methods.In hyper-heuristic,the high-level search is executed to construct heuristic lists by traditional methods(such as Tabu search,variable neighborhoods and so on).The purpose of this paper is to apply the evolutionary strategy instead of traditional methods for high-level search to improve the capability of global search.Design/methodology/approach–This paper combines hyper-heuristic with evolutionary strategy to solve examination timetabling problems.First,four graph coloring heuristics are employed to construct heuristic lists.Within the evolutionary algorithm framework,the iterative initialization is utilized to improve the number of feasible solutions in the population;meanwhile,the crossover and mutation operators are applied to find potential heuristic lists in the heuristic space(high-level search).At last,two local search methods are combined to optimize the feasible solutions in the solution space(low-level search).Findings–Experimental results demonstrate that the proposed approach obtains competitive results and outperforms the compared approaches on some benchmark instances.Originality/value–The contribution of this paper is the development of a framework which combines evolutionary algorithm and hyper-heuristic for examination timetabling problems.

关键词： Evolutionary computation Examination timetabling problem Hyper-heuristic memetic algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：