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

An effective hyper heuristic-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem

引用

APPLIED SOFT COMPUTING 2023年 135卷

作者： Song, Hong-Bo Yang, You-Hong Lin, Jian Ye, Jing-Xuan Zhejiang Univ Finance & Econ Sch Informat Management & Artificial Intelligence Hangzhou 310018 Peoples R China

In this paper, an effective Hyper Heuristic-based Memetic algorithm (HHMA) is proposed to solve the Distributed Assembly Permutation Flow-shop Scheduling Problem (DAPFSP) with the objective of minimizing the maximum completion time. A novel searching-stage-based solution representation scheme is presented for both improving the search efficiency and maintaining potential solutions. In the global search stage, estimation of distribution algorithm (EDA) is employed as the high level strategy of EDA-based Hyper Heuristic (EDAHH) to find promising product sequences for further exploitation. Based on the newly found knowledge of critical-products, several efficient Low-Level Heuristics (LLHs) are well designed to construct the LLH set so that the powerful exploration ability of the EDAHH can be guaranteed. A simulated-annealing-like type of acceptance criterion is also embedded into each LLH to avoid premature convergence. Then a Critical-Products-based Referenced Local Search (CP-RLS) method is proposed to improve the quality of superior sub-population by operating on the sub-job-sequences derived from the critical products. The benefit of the presented CP-RLS lies in the excellent exploitation ability with substantially reduced computational cost. Finally, performance evaluation and comparison are both carried out on a benchmark set and the results demonstrate the superiority of HHMA over the state-of-the-art algorithms for the DAPFSP.(c) 2023 Elsevier B.V. All rights reserved.

关键词： Distributed assembly flow-shop scheduling estimation of distribution algorithm Hyper heuristic Memetic algorithm Critical-products-based local search

来源：评论

学校读者我要写书评

暂无评论

Adaptive Memetic Computing for Evolutionary Multiobjective Optimization

引用

IEEE TRANSACTIONS ON CYBERNETICS 2015年第4期45卷 610-621页

作者： Shim, Vui Ann Tan, Kay Chen Tang, Huajin Inst Infocomm Res Singapore 138632 Singapore Natl Univ Singapore Dept Elect & Comp Engn Singapore 117576 Singapore

Inspired by biological evolution, a plethora of algorithms with evolutionary features have been proposed. These algorithms have strengths in certain aspects, thus yielding better optimization performance in a particular problem. However, in a wide range of problems, none of them are superior to one another. Synergetic combination of these algorithms is one of the potential ways to ameliorate their search ability. Based on this idea, this paper proposes an adaptive memetic computing as the synergy of a genetic algorithm, differential evolution, and estimation of distribution algorithm. The ratio of the number of fitter solutions produced by the algorithms in a generation defines their adaptability features in the next generation. Subsequently, a subset of solutions undergoes local search using the evolutionary gradient search algorithm. This memetic technique is then implemented in two prominent frameworks of multiobjective optimization: the domination- and decomposition-based frameworks. The performance of the adaptive memetic algorithms is validated in a wide range of test problems with different characteristics and difficulties.

关键词： Differential evolution estimation of distribution algorithm evolutionary gradient search genetic algorithm memetic computing multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network

引用

APPLIED SOFT COMPUTING 2024年 166卷

作者： Gao, Yuan Kasihmuddin, Mohd Shareduwan Mohd Chen, Ju Zheng, Chengfeng Romli, Nurul Atiqah Mansor, Mohd. Asyraf Zamri, Nur Ezlin Chengdu Univ Tradit Chinese Med Sch Med Informat Engn Chengdu 610037 Peoples R China Univ Sains Malaysia Sch Math Sci George Town 11800 Malaysia Univ Sains Malaysia Sch Distance Educ George Town 11800 Malaysia Univ Putra Malaysia Fac Sci Dept Math & Stat Serdang 43400 Selangor Malaysia

This study introduced a novel ant colony optimization algorithm that implements the population selection strategy of the estimation of distribution algorithm and a new pheromone updating formula. It aimed to optimize the performance of G-type random high-order satisfiability logic structures embedded in Discrete Hopfield Neural Networks, thereby enhancing the efficiency of the Hopfield Neural Network learning algorithm. Through comparative analysis with other metaheuristic algorithms, our model demonstrated superior performance in terms of global convergence, time complexity, and algorithm complexity. Additionally, we evaluated the learning phase, retrieval phase, and similarity analysis using various ratios of literals and clauses. It was shown that our proposed model exhibits stronger search ability compared to other metaheuristic algorithms and Exhaustive Search. Our model enhanced the efficiency of the learning phase, resulting in the number of global solutions accounting for 100 %, and significantly improved the global solution diversity. These advancements contributed to the efficiency of the model in convergence, rendering it applicable to a wide range of nonlinear classification and prediction problems.

关键词： Ant colony optimization estimation of distribution algorithm Discrete Hopfield neural network Metaheuristic algorithms Classification

来源：评论

学校读者我要写书评

暂无评论

A distribution evolutionary algorithm for the graph coloring problem

引用

SWARM AND EVOLUTIONARY COMPUTATION 2023年 80卷

作者： Xu, Yongjian Cheng, Huabin Xu, Ning Chen, Yu Xie, Chengwang Wuhan Univ Technol Sch Sci Wuhan 430070 Peoples R China Wuchang Shouyi Univ Dept Basic Sci Wuhan 430064 Peoples R China Wuhan Univ Technol Sch Informat Engn Wuhan 430070 Peoples R China South China Normal Univ Sch Data Sci & Engn Guangzhou 516600 Guangdong Peoples R China

Graph coloring is a challenging combinatorial optimization problem with a wide range of applications. In this paper, a distribution evolutionary algorithm based on a population of probability model (DEA-PPM) is developed to address it efficiently. Unlike existing estimation of distribution algorithms where a probability model is updated by generated solutions, DEA-PPM employs a distribution population based on a novel probability model, and an orthogonal exploration strategy is introduced to search the distribution space with the assistance of an refinement strategy. By sampling the distribution population, efficient search in the solution space is realized based on a tabu search process. Meanwhile, DEA-PPM introduces an iterative vertex removal strategy to improve the efficiency of k-coloring, and an inherited initialization strategy is implemented to address the chromatic number problem well. The cooperative evolution of the distribution population and the solution population leads to a good balance between exploration and exploitation. Numerical results demonstrate that the DEA-PPM of small population size is competitive to the state-of-the-art metaheuristics.

关键词： distribution evolutionary algorithm Orthogonal exploration Inherited initialization Graph coloring estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

Double-Objective Optimal Control for Non-Gaussian Systems: An Example Study on Analytical vs Numerical Solutions

引用

IFAC-PapersOnLine 2015年第8期48卷 924-929页

作者： Mifeng Ren Jianhua Zhang Hong Wang Min Huang College of Information Engineering Taiyuan University of Technology Taiyuan 030024 China State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University Beijing 102206 China Control System Centre School of Electrical and Electronics Engineering The University of Manchester M60 1QD UK China State Key Laboratory of Synthetical Automation for Process Industry Northeastern University Shenyang 110819 China

Minimum entropy control has been proven to be an effective method in control of non-Gaussian stochastic systems. In this case, the entropy is proposed as a generalization of the variance measure to characterize the randomness of the process. Minimum entropy corresponds to small uncertainty (or derivation), but it cannot guarantee the tracking error approaching to zero. Therefore, mean square error also should be added in the criterion. In this paper, by using a simple example, the method of generating a representative approximation of the Pareto optimal control set is investigated in both analytical and numerical ways. And simulation results show the feasibility of the proposed double-objective optimal control method.

关键词： Double-objective optimal control non-Gaussian stochastic systems Renyi's entropy e - constrained method estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

The maximal covering location problem with accessibility indicators and mobile units

引用

SOCIO-ECONOMIC PLANNING SCIENCES 2023年第PartB期87卷

作者： Vicencio-Medina, Salvador J. Rios-Solis, Yasmin A. Ibarra-Rojas, Omar Jorge Cid-Garcia, Nestor M. Rios-Solis, Leonardo Tecnol Monterrey Sch Engn & Sci Ave Eugenio Garza Sada 2501 Monterrey 64849 NL Mexico Univ Autonoma Nuevo Leon Fac Ciencias Fisico Matemat San Nicolas De Los Garza 66455 Nuevo Leon Mexico CONACYT Ctr Invest Ciencias Informac Geoespacial Lab Nacl Geointeligencia Aguascalientes Aguascalientes Mexico Univ Edinburgh Inst Bioengn Sch Engn Edinburgh EH9 3BF Scotland Univ Edinburgh Ctr Synthet & Syst Biol SynthSys Edinburgh EH9 3BF Scotland Newcastle Univ Sch Nat & Environm Sci Mol Biol & Biotechnol Newcastle Upon Tyne NE1 7RU England

We study the Maximal Covering Location Problem with Accessibility Indicators and Mobile Units that maximizes the facilities coverage, the accessibility of the zones to the open facilities, and the spatial disaggregation. The main characteristic of our problem is that mobile units can be deployed from open facilities to extend the coverage, accessibility, and opportunities for the inhabitants of the different demand zones. We formulate the Maximal Covering Location Problem with Accessibility Indicators and Mobile Units as a mixed-integer linear programming model. To solve larger instances, we propose a matheuristic (combination of exact and heuristic methods) composed of an estimation of distribution algorithm and a parameterized Maximal Covering Location Problem with Accessibility Indicators and Mobile Units integer model. To test our methodology, we consider the Maximal Covering Location Problem with Accessibility Indicators and Mobile Units model to cover the low-income zones with Severe Acute Respiratory Syndrome Coronavirus 2 patients. Using official databases, we made a set of instances where we considered the poverty index, number of population, locations of hospitals, and Severe Acute Respiratory Syndrome Coronavirus 2 patients. The experimental results show the efficiency of our methodologies. Compared to the case without mobile units, we drastically improve the coverage and accessibility for the inhabitants of the demand zones.

关键词： Facility location problem Matheuristic COVID-19 Mixed-integer linear program Accessibility estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

Model-Based Position and Reflectivity estimation of Fiber Bragg Grating Sensor Arrays

引用

SENSORS 2018年第7期18卷 2268-2268页

作者： Werzinger, Stefan Zibar, Darko Koepel, Max Schmauss, Bernhard Friedrich Alexander Univ Erlangen Nurnberg Inst Microwaves & Photon Cauerstr 9 D-91058 Erlangen Germany Tech Univ Denmark DTU Foton DK-2800 Lyngby Denmark Friedrich Alexander Univ Erlangen Nurnberg Grad Sch Adv Opt Studies SAOT D-91052 Erlangen Germany Max Planck Inst Sci Light Staudtstr 2 D-91058 Erlangen Germany

We propose an efficient model-based signal processing approach for optical fiber sensing with fiber Bragg grating (FBG) arrays. A position estimation based on an estimation of distribution algorithm (EDA) and a reflectivity estimation method using a parametric transfer matrix model (TMM) are outlined in detail. The estimation algorithms are evaluated with Monte Carlo simulations and measurement data from an incoherent optical frequency domain reflectometer (iOFDR). The model-based approach outperforms conventional Fourier transform processing, especially near the spatial resolution limit, saving electrical bandwidth and measurement time. The models provide great flexibility and can be easily expanded in complexity to meet different topologies and to include prior knowledge of the sensors. Systematic errors due to crosstalk between gratings caused by multiple reflections and spectral shadowing could be further considered with the TMM to improve the performance of large-scale FBG array sensor systems.

关键词： optical fiber sensing fiber Bragg gratings signal processing modeling estimation of distribution algorithm optical frequency domain reflectometry temperature sensing

来源：评论

学校读者我要写书评

暂无评论

A Learning Strategy for Multi-robot Based on Probabilistic Evolutionary algorithm

A Learning Strategy for Multi-robot Based on Probabilistic E...

引用

8th World Congress on Intelligent Control and Automation (WCICA)

作者： Fan, Jiancong Liang, Yongquan Ruan, Jiuhong Shandong Univ Sci & Technol Coll Informat Sci & Engn Qingdao Shandong Peoples R China Shandong Jiaotong Univ Sci Res Dept Jinan 250023 Peoples R China

ISBN: (纸本)9781424467129

estimation of distribution algorithm (EDA) is a new evolutionary computation method based on probabilistic theory. EDA can select optimal individuals through estimating probability distribution function of a population. The capture problem among multi software robots can be solved by EDA. The capture problem involves that some pursuers pursue several evaders through part of trajectory. The trajectory was produced by the evaders during their two-dimensional random mobility. The pursuers estimate the evaders' mobility functions and adjust their pursuit models to capture the evaders as fast as possible. The probabilistic evolutionary courses of multi-robot experiencing some competitions are analyzed in performances. The analysis shows that capture problem of multi-robot solved by EDA is better than other methods in several aspects.

关键词： evolutionary computation estimation of distribution algorithm multi-robot competition capture course

来源：评论

学校读者我要写书评

暂无评论

Research on gas emission quantity prediction model based on EDA-IGA

引用

HELIYON 2023年第7期9卷 e17624页

作者： Ji, Peng Shi, Shiliang Shi, Xingyu Hunan Univ Sci & Technol Coll Resource Environm & Safety Engn Xiangtan 411201 Peoples R China Hunan Univ Sci & Technol Prov Key Lab Safe Min Tech Coal Mines Taoyuan Rd Xiangtan 411201 Hunan Peoples R China Changsha Univ Sci & Technol Wanjiali Rd Changsha 410114 Hunan Peoples R China

In order to accurately predict the possible gas emission quantity in coal mines, it is proposed to use the multi-thread calculation of the Immune Genetic algorithm (IGA) and injection of vaccines to improve the accuracy of prediction and combine the estimation of distribution algorithm (EDA) to the distribution probability of excellent populations. Calculating, and selecting excellent populations for iteration, optimize the population generation process of the Immune Genetic algorithm, so that the population quality is continuously optimized and improved, and the optimal solution is obtained, thereby establishing a gas emission quantity prediction model based on the Immune Genetic algorithm and estimation of distribution algorithm. Using the 9136 mining face with gas emission hazards in a coal mine from Shandong Province in China as the prediction object, the absolute gas emission quantity is used to scale the gas emission quantity, and it is found that the model can accurately predict the gas emission quantity, which is consistent with the on-site emission unanimous. In the prediction comparison with IGA, it is found that the accuracy of the prediction results has increased by 9.51%, and the number of iterations to achieve the required goal has been reduced by 67%, indicating that the EDA has a better role in optimizing the population update process such as genetic selection of the IGA. Comparing the prediction results of other models, it is found that the prediction accuracy of the EDA-IGA is 94.93%, which is the highest prediction accuracy, indicating that this prediction model can be used as a new method for the prediction of coal mine gas emission. Accurately predicting the gas emission quantity can provide guidance for safe mining in coal mines. The gas emission quantity can also be used as a safety indicator to reduce the possibility of coal mine accidents, ensure the personal safety of coal miners and reduce economic losses in coal mines.

关键词： Gas emission quantity Immune genetic algorithm estimation of distribution algorithm Prediction

来源：评论

学校读者我要写书评

暂无评论

Maximizing Net Present Value for Resource Constraint Project Scheduling Problems with Payments at Event Occurrences Using Approximate Dynamic Programming

引用

algorithmS 2024年第5期17卷 180页

作者： Phuntsho, Tshewang Gonsalves, Tad Sophia Univ Dept Informat & Comp Sci Chiyoda Ku Tokyo 1028554 Japan Royal Univ Bhutan Gedu Coll Business Studies POB 21006 Bongo Bhutan

Resource Constraint Project Scheduling Problems with Discounted Cash Flows (RCPSPDC) focuses on maximizing the net present value by summing the discounted cash flows of project activities. An extension of this problem is the Payment at Event Occurrences (PEO) scheme, where the client makes multiple payments to the contractor upon completion of predefined activities, with additional final settlement at project completion. Numerous approximation methods such as metaheuristics have been proposed to solve this NP-hard problem. However, these methods suffer from parameter control and/or the computational cost of correcting infeasible solutions. Alternatively, approximate dynamic programming (ADP) sequentially generates a schedule based on strategies computed via Monte Carlo (MC) simulations. This saves the computations required for solution corrections, but its performance is highly dependent on its strategy. In this study, we propose the hybridization of ADP with three different metaheuristics to take advantage of their combined strengths, resulting in six different models. The estimation of distribution algorithm (EDA) and Ant Colony Optimization (ACO) were used to recommend policies for ADP. A Discrete cCuckoo Search (DCS) further improved the schedules generated by ADP. Our experimental analysis performed on the j30, j60, and j90 datasets of PSPLIB has shown that ADP-DCS is better than ADP alone. Implementing the EDA and ACO as prioritization strategies for Monte Carlo simulations greatly improved the solutions with high statistical significance. In addition, models with the EDA showed better performance than those with ACO and random priority, especially when the number of events increased.

关键词： approximate dynamic programming net present value discounted cash flows Discrete Cuckoo Search estimation of distribution algorithm Ant Colony Optimization Payment at Event Occurrences

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：