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

13th International Conference on Parallel Problem Solving from Nature (PPSN)

作者： Cox, Chris R. Watson, Richard A. Univ Southampton Dept Elect & Comp Sci Southampton SO9 5NH Hants England

ISBN: (纸本)9783319107622;9783319107615

In this work we introduce a model-building algorithm that is able to infer problem structure using generative grammar induction. We define a class of grammar that can represent the structure of a problem space as a hierarchy of multivariate patterns (schemata), and a compression algorithm that can infer an instance of the grammar from a collection of sample individuals. Unlike conventional sequential grammars the rules of the grammar define unordered set-membership productions and are therefore insensitive to gene ordering or physical linkage. We show that when grammars are inferred from populations of fit individuals on shuffled nearest-neighbour NK-landscape problems, there is a correlation between the compressibility of a population and the degree of inherent problem structure. We also demonstrate how the information captured by the grammatical model from a population can aid evolutionary search. By using the lexicon of schemata inferred into a grammar to facilitate variation, we show that a population is able to incrementally learn and then exploit its own structure to find fitter regions of the search space, and ultimately locate the global optimum.

关键词： Generative grammar compression evolutionary algorithm estimation of distribution algorithm NK fitness landscape

来源：评论

学校读者我要写书评

暂无评论

Design of Passive Analog Electronic Circuits Using Hybrid Modified UMDA algorithm

Design of Passive Analog Electronic Circuits Using Hybrid Mo...

引用

作者： Slezak, J. Brno University of Technology

Hybrid evolutionary passive analog circuits synthesis method based on modified Univariate Marginal distribution algorithm (UMDA) and a local search algorithm is proposed in the paper. The modification of the UMDA algorithm which allows to specify the maximum number of the nodes and the maximum number of the components of the synthesized circuit is proposed. The proposed hybrid approach efficiently reduces the number of the objective function evaluations. The modified UMDA algorithm is used for synthesis of the topology and the local search algorithm is used for determination of the parameters of the components of the designed circuit. As an example the proposed method is applied to a problem of synthesis of the fractional capacitor circuit.

关键词： Evolutionary algorithm optimization estimation of distribution algorithm EDA analog circuit design fractional capacitor

来源：评论

学校读者我要写书评

暂无评论

A scheduling algorithm for heterogeneous computing systems by edge cover queue

引用

KNOWLEDGE-BASED SYSTEMS 2023年第1期265卷

作者： Chen, Yu-meng Liu, Song -lin Chen, Yan-jun Ling, Xiang Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Sichuan Peoples R China

In heterogeneous computing systems, excellent task scheduling algorithms can shorten the task completion time and improve system parallelism. With the large-scale deployment of edge computing, the task scheduling algorithm in heterogeneous edge computing servers has become a critical factor in improving the overall system performance. This paper proposes a new task scheduling algorithm called the edge cover scheduling algorithm (ECSA), which schedules tasks based on the edge cover queue of the directed acyclic graph (DAG) for heterogeneous computing systems. Based on the estimation of distribution algorithm (EDA) and the graph random walk algorithm, the ECSA generates an edge cover queue from DAG. Then, the ECSA uses the heuristics greedy method with low time and computational complexity to allocate the edge cover queue to processors. Theoretical analysis and simulation results on random DAGs and real-world DAGs show that the ECSA can achieve better scheduling results in terms of makespan, the schedule length ratio (SLR), efficiency, and frequency of best results with low time and computational complexity.(c) 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： Heterogeneous computing system Edge cover queue estimation of distribution algorithm Graph random walk algorithm

来源：评论

学校读者我要写书评

暂无评论

Surrogate-assisted cooperative signal optimization for large-scale traffic networks

引用

KNOWLEDGE-BASED SYSTEMS 2021年 234卷 1页

作者： Liang, Yongsheng Ren, Zhigang Wang, Lin Liu, Hanqing Du, Wenhao Xi An Jiao Tong Univ Sch Automat Sci & Engn 28 Xianning West Rd Xian 710049 Shaanxi Peoples R China Northwest Univ Sch Informat Sci & Technol Xian Peoples R China

Reasonable setting of traffic signals can be very helpful in alleviating congestion in urban traffic networks. Meta-heuristic optimization algorithms have proved themselves to be able to find high quality signal timing plans. However, they generally suffer from performance deterioration when solving large-scale traffic signal optimization problems due to the huge search space and limited computational budget. Directing against this issue, this study proposes a surrogate-assisted cooperative signal optimization (SCSO) method. Different from existing methods that directly deal with the entire traffic network, SCSO first decomposes it into a set of tractable sub-networks, and then achieves signal setting by cooperatively optimizing these sub-networks with a surrogate-assisted optimizer. The decomposition operation significantly narrows the search space of the whole traffic network, and the surrogate-assisted optimizer greatly lowers the computational burden by reducing the number of expensive traffic simulations. By taking Newman fast algorithm, radial basis function and a modified estimation of distribution algorithm as decomposer, surrogate model and optimizer, respectively, this study develops a concrete SCSO algorithm. To evaluate its effectiveness and efficiency, a large-scale traffic network involving crossroads and T-junctions is generated based on a real traffic network. Comparison with several existing meta-heuristic algorithms specially designed for traffic signal optimization demonstrates the superiority of SCSO in reducing the average delay time of vehicles. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Traffic signal optimization Large-scale traffic network Cooperative co-evolution Surrogate model estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

Reliability evaluation of a composite power system in the presence of renewable generations

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2022年第0期222卷 108396-108396页

作者： Firouzi, Mohsen Samimi, Abouzar Salami, Abolfazl Arak Univ Technol Dept Elect Engn Arak Iran

Power system reliability evaluation plays a vital role in the planning and operation studies by reflecting the system safety level. In this paper, a combination of a non-sequential Monte Carlo simulation (MCS)-based model and an improved estimation of distribution algorithm (EDA) is exploited for evaluating the reliability of the composite power systems considering variability and uncertainty of wind farms (WFs) and Photovoltaic (PV) units. Variability of these resources is defined as the random fluctuation of wind speed and solar irradiation caused by changes in the atmosphere, while their uncertainty results from output power forecast errors. In the proposed model, the states of traditional generating units, transmission lines, WFs, and PV units are constructed using non-sequential MCS. These states can be achieved based on the component failure probability for dispatchable traditional generators and transmission lines along with the Probability distribution Functions (PDFs) of renewable generations. To enhance the computational efficiency of the MCS in the sampling step, the improved EDA upgraded with the Population-Based Incremental Learning (PBIL) algorithm is employed. The proposed mathematical model for reliability evaluation of composite power system is applied to the IEEE RTS 24-bus system, and numerical studies are performed under several case studies. The simulation results confirm the proficiency of the proposed method to improve the computational efficiency, while the high accuracy of reliability evaluation of the composite power system is attained.

关键词： Composite power system Reliability Uncertainty Renewable energy resources Non-sequential Monte Carlo simulation estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

Aligning heterogeneous optimization problems with optimal correspondence assisted affine transformation for evolutionary multi-tasking

引用

APPLIED SOFT COMPUTING 2023年 136卷

作者： Chen, An Ren, Zhigang Wang, Muyi Su, Shenyu Yun, Jiaqi Wang, Yichuang Xi An Jiao Tong Univ Sch Automat Sci & Engn Xian Peoples R China Xi An Jiao Tong Univ Sch Automat Sci & Engn 28 Xianning West Rd Xian 710049 Shaanxi Peoples R China

Evolutionary multi-tasking optimization (EMTO) aims to boost the overall efficiency of optimizing multiple tasks by triggering knowledge transfer among them. Unfortunately, it may suffer from negative transfer on heterogeneous composite tasks that have low similarity. Some studies try to learn an intertask alignment transformation based on the paired samples from the involved tasks, but risk a failed alignment with improper pairwise methods. To solve this issue, this study proposes an optimal correspondence assisted affine transformation (OCAT) algorithm. OCAT explicitly constructs a mathematical model for the intertask alignment problem and theoretically deduces its optimal solution in an iterative method. As a result, the sample correspondences that enable the learned transformation to achieve the maximum intertask similarity can be located. Besides, a novel approach to deriving the affine transformation formula is also developed for OCAT. The resulting affine alignment transformation will not impair the knowledge contained in the tasks during the alignment process. By integrating OCAT with the estimation of distribution algorithm, this study finally develops a many-tasking optimization algorithm named MaT-EDA, where the solutions from other tasks are explicitly transferred as the samples for estimating the current distribution model. Extensive simulation studies have indicated that OCAT can significantly enhance the performance of EMTO, and MaT-EDA also achieves impressive many-tasking optimization performance.(c) 2023 Elsevier B.V. All rights reserved.

关键词： Evolutionary multi-tasking Intertask alignment Affine transformation Many-tasking optimization estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

BIVARIATE DEPENDENCY FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

引用

INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE 2020年第3期27卷 473-499页

作者： Ricardo, Perez-Rodriguez Arturo, Hernandez-Aguirre UAQ Autonomous Univ Queretaro Fac Engn CONACYT Queretaro Mexico CIMAT AC Ctr Math Res Dept Comp Sci Guanajuato Mexico

The main purpose of the vehicle routing problem (VRP) is to deliver a set of customers with known demands on minimum travel routes starting and terminating at the same depot. The vehicle routing problem with time windows (VRPTW) requires the delivery made in a specific time window for every customer and returning to the depot before a due time. Contrary to current research, an estimation of distribution algorithm-based approach is proposed and developed to solve the problem and implement the solution. The approach mentioned makes use of a probability model based on the Pearson's correlation coefficient to describe the distribution of the solution space. Different and diverse instances served as input and test parameters in order to show that the estimation of any relationship and/or interaction between vertices on the sequence of the VRPTW solution can be improved. A better position for each vertex on the sequence can be estimated through a probability model using the Pearson's correlation coefficient.

关键词： estimation of distribution algorithm vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

Manufacturing rescheduling after crisis or disaster-caused supply chain disruption

引用

COMPUTERS & OPERATIONS RESEARCH 2023年第1期157卷

作者： Bo, Hongguang Chen, Xiao Alison Luo, Qian Wang, Wenpeng Dalian Univ Technol Sch Econ & Management 2 Linggong Rd Dalian Peoples R China Univ New Hampshire Peter T Paul Coll Business & Econ 10 Garrison Ave Durham NH 03824 USA Xian Jiaotong Liverpool Univ Int Business Sch Suzhou 111 RenAi Rd Suzhou Peoples R China

In this paper, we study the problems a repair shop has with rescheduling after major supply disruptions. The repair shop provides repair and maintenance services to its customers. After a major disruption to production, the repair shop faces delays in production and order delivery due to shortages in materials and/or labor, which requires rescheduling of all the unfinished parts. We observe that the finished parts incur high holding costs until the entire order is completed, while any unfinished parts (in the form of raw material or work-in-progress) incur low holding costs until production starts. Moreover, the repair shop incurs a setup cost when switching between different types of parts. Considering these new features, we formulate the rescheduling problem for the repair shop under a coordinated supply chain as an integer program to minimize the total tardiness, setup cost, and holding cost. To solve the model, we propose an innovative two-stage genetic algorithm, which utilizes the estimation of distribution algorithm (EDA) to improve the search process of the optimal solution. We test the performance of this algorithm on a dataset generated from the order data of a heavy machinery maintenance provider. The numerical results show that our model generates solutions that outperform the initial schedule, which was obtained by minimizing holding and setup costs without disruption. In addition, using other closely-related genetic algorithms as benchmarks, we show that our algorithm outperforms the benchmarks without sacrificing the computational time. We also discuss an extension of the main model by considering the recovery of productivity in terms of processing time.

关键词： Production rescheduling Supply chain disruption Two-stage genetic algorithm estimation of distribution algorithm Productivity recovery

来源：评论

学校读者我要写书评

暂无评论

GA-EDA: Hybrid Design Space Exploration Engine for Multicore Architecture

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2021年第10期30卷 2150181-2150181页

作者： Waris, Hira Ahmad, Ayaz Qadri, Muhammad Yasir Raja, Gulistan Malik, Tahir Nadeem Univ Engn & Technol Taxila Pakistan COMSATS Univ Islamabad Dept Elect & Comp Engn Wah Campus Wah Cantt Pakistan Univ Essex Colchester Essex England

Emergence of modern multicore architectures has made runtime reconfiguration of system resources possible. All reconfigurable system resources constitute a design space and the proper selection of configuration of these resources to improve the system performance is known as Design Space Exploration (DSE). This reconfiguration feature helps in appropriate allocation of system resources to improve the efficiency in terms of performance, energy consumption, throughput, etc. Different techniques like exhaustive search of design space, architect's experience, etc. are used for optimization of system resources to achieve desired goals. In this work, we hybridized two optimization algorithms, i.e., Genetic algorithm (GA) and estimation of distribution algorithm (EDA) for DSE of computer architecture. This hybrid algorithm achieved optimal balance between two objectives (minimal energy consumption and maximal throughput) by using decision variables such as number of cores, cache size and operating frequency. The final set of optimal solutions proposed by this GA-EDA hybrid algorithm is explored and verified by running different benchmark applications derived from SPLASH-2 benchmark suite on a cycle level simulator. The significant reduction in energy consumption without extensive impact on throughput in simulation results validate the use of this GA-EDA hybrid algorithm for DSE of multicore architecture. Moreover, the simulation results are compared with that of standalone GA, EDA and fuzzy logic to show the efficiency of GA-EDA hybrid algorithm.

关键词： Design space exploration multicore architecture estimation of distribution algorithm genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：