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

Design robust controller for automatic generation control in restructured power system by imperialist competitive algorithm

引用

IETE JOURNAL OF RESEARCH 2013年第6期59卷 745-752页

作者： Hosseini, Hosssein Tousi, Behrooz Razmjooy, Navid Khalilpour, Mohsen Univ Urmia Young Researchers Club Fac Engn Dept Eelectr Engn Orumiyeh Iran Islamic Azad Univ Isfahan Branch Esfahan Iran Islamic Azad Univ Ardabil Branch Ardebil Iran

Nowadays, automatic generation control (AGC) is a very impressive problem in restructured power system operation for providing electric power with high quality and reliability. In this paper, the three-area multi-units system has been selected for AGC in a restructured power system. Federal energy regulatory commission supports an open market system for price-based operation. The theory of DISCO participation matrix is used to simulate the bilateral contracts in the three-area multi-units systems. In a restructured system because of open market system the power flow between areas is varying continuously however the system must be able to maintain stability in all conditions. In this paper, two cases for design robust controller have been considered. A new method using the imperialist competitive algorithm for designing this controller has been used. Finally, the obtained results are compared with other methods.

关键词： Automatic generation control Restructured power system Robust controller imperialist competitive algorithm

来源：评论

学校读者我要写书评

暂无评论

An improved multi-objective imperialist competitive algorithm for surgical case scheduling problem with switching and preparation times

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2022年第5期25卷 3591-3616页

作者： Yu, Hui Li, Jun-qing Chen, Xiao-long Niu, Wei Sang, Hong-yan Shandong Normal Univ Sch Informat Sci & Engn Jinan 250000 Peoples R China Liaocheng Univ Sch Informat Liaocheng 252059 Shandong Peoples R China

Surgical case scheduling is a key issue in the field of medician, which is a challenging work because of the difficulty in assigning resources to patients. This study regards the surgical case scheduling problem as a flexible job shop scheduling problem (FJSP). Considering the switching and preparation time of patients in different stage, an improved multi-objective imperialist competitive algorithm (IMOICA), which adopts the non-dominant sorting method, is proposed to optimize the whole scheduling. First, the social hierarchy strategy is developed to initialize the empire. Then, to enhance the global search ability of the algorithm, the concept of attraction and repulsion (AR) is introduced into the assimilation strategy. Moreover, to increase the diversity of the population, the revolution strategy is utilized. Finally, the variable neighborhood search (VNS) strategy is embedded to improve its exploitation capacity further. Experiments show that scheduling in advance saves time and cost, and IMOICA can solve the surgical case scheduling problem studied efficiently.

关键词： Surgical case scheduling imperialist competitive algorithm Variable neighborhood search strategy

来源：评论

学校读者我要写书评

暂无评论

A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2013年第5-8期65卷 981-989页

作者： Banisadr, A. H. Zandieh, M. Mahdavi, Iraj Mazandaran Univ Sci & Technol Dept Ind Engn Babol Sar Iran Shahid Beheshti Univ Dept Ind Management Management & Accounting Fac GC Tehran Iran

In this paper, we study single-machine scheduling problem when each job is considered with linear earliness and quadratic tardiness penalties with no machine idle time. Here the objective is to find the best sequence of jobs in the reasonable time. This model was studied in several researches, and some algorithms were proposed to solve it such as genetic algorithm. As the size of problem increased, such algorithms were not effective and efficient. Hence, we proposed the hybrid imperialist competitive algorithm. The proposed algorithm is based upon the imperialist competitive algorithm and genetic algorithm concepts. This algorithm was tested in problems with different sizes. The results denoted that the hybrid algorithm can solve different size of problem in reasonable time. This procedure showed its efficiency in medium- and large-sized problems as compared with other available methods.

关键词： Hybridization imperialist competitive algorithm Single-machine scheduling Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Supplier selection in a single-echelon supply chain with horizontal competition using imperialist competitive algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING 2015年第6期28卷 628-638页

作者： Kermani, Mehrdad Agha Mohammad Ali Aliahmadi, Alireza Salamat, Vahid Reza Barzinpour, Farnaz Hadiyan, Ehsan Iran Univ Sci & Technol Dept Ind Engn Tehran Iran Islamic Azad Univ Dept Elect Engn Mashhad Iran

Nowadays, due to the importance of competition in supply chain, supplier selection is one of the most important issues in competition between manufacturers. Different companies take various criteria into account to select the appropriate suppliers. In this paper, we study a supplier selection problem, considering three key criteria: price, quality and delivery performance. For the first time in this paper a single-echelon supply chain has been studied at which each manufacturer tries not only to optimise his/her own situation but also to remove the other buyers from their optimum points. Hence, this paper considered a new competitive supplier selection problem with some assumption according to real world. In addition, because of new assumptions and complexity of the studied problem, an imperialist competitive algorithm has been used to solve the problem. Finally the success of the mentioned model will be supported by a numerical example and the difference between decision making in competitive and non-competitive market will be shown.

关键词： imperialist competitive algorithm supply chain competition supplier selection

来源：评论

学校读者我要写书评

暂无评论

An improved imperialist competitive algorithm based photolithography machines scheduling

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2018年第3期56卷 1017-1029页

作者： Zhang, Peng Lv, Youlong Zhang, Jie Shanghai Jiao Tong Univ Inst Intelligent Mfg & Informat Engn Shanghai Peoples R China Donghua Univ Coll Mech Engn Shanghai Peoples R China

Photolithography machine is one of the most expensive equipment in semiconductor manufacturing system, and as such is often the bottleneck for processing wafers. This paper focuses on photolithography machines scheduling with the objective of total completion time minimisation. In contrast to classic parallel machines scheduling, it is characterised by dynamical arrival wafers, re-entrant process flows, dedicated machine constraints and auxiliary resources constraints. We propose an improved imperialist competitive algorithm (ICA) within the framework of a rolling horizon strategy for the problem. We develop a variable time interval-based rolling horizon strategy to decide the scheduling point. We address the global optimisation in every local scheduling by proposing a mixed cost function. Moreover, an adaptive assimilation operator and a sociopolitical competition operator are used to prevent premature convergence of ICA to local optima. A chaotic sequence-based local search method is presented to accelerate the rate of convergence. Computational experiments are carried out comparing the proposed algorithm with ILOG CPLEX, dispatching rules and meta-heuristic algorithms in the literature. It is observed that the algorithm proposed shows an excellent behaviour on cycle time minimisation while with a good on time delivery rate and machine utilisation rate.

关键词： semiconductor manufacturing system photolithography machine parallel machines scheduling rolling horizon imperialist competitive algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel imperialist competitive algorithm With Multi-Elite Individuals Guidance for Multi-Object Unrelated Parallel Machine Scheduling Problem

引用

IEEE ACCESS 2019年 7卷 121223-121235页

作者： Wang, Mei Pan, Guohua Yantai Vocat Coll Lab Image Proc & Pattern Recognit Yantai 264670 Peoples R China Yantai Publ Secur Bur Yantai 264670 Peoples R China

In this study unrelated parallel machine scheduling problem (UPMSP) with preventive maintenance (PM) and sequence dependent setup times (SDST) is investigated. A novel imperialist competitive algorithm (NICA) with multi-elite individuals guidance is proposed to minimize makespan and total tardiness simultaneously. Initialization is done by two heuristics, each of which is built based on one objective. Multielite individuals guidance strategy is added in assimilation that colonies can move toward other imperialists, diversified strategies such as local search and estimation of distribution algorithm (EDA) are adopted based on solution quality in revolution and EDA is also used in imperialist competition. Empire aggression is added by local search of imperialist for plundering a randomly chosen colony. A number of experiments are conducted on the impact of new strategies and the comparisons among NICA and other algorithms. Computational results demonstrate the effectiveness and advantages of NICA in solving UPSMP with PM and SDST.

关键词： Preventive maintenance setup times imperialist competitive algorithm multi-elite individual guidance estimation of distribution algorithm

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic and imperialist competitive algorithm approach to dynamic cellular manufacturing system

引用

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE 2014年第3期228卷 458-470页

作者： Bagheri, Masoud Bashiri, Mahdi Shahed Univ Fac Engn Dept Ind Engn Tehran *** Iran

Cellular manufacturing system is an important application of group technology, which deals with grouping the parts and machines into cells, based on their similarity in design or production process. Since a purpose of this article is designing the cells under indefinite demand values up to the end of previous period, a dynamic multi-objective mathematical model based on this condition is proposed, and a heuristic approach has been developed in order to solve the problem. During this procedure, since the proposed model is a nondeterministic polynomial-time-hard problem, a new hybrid meta-heuristic approach called genetic imperialist competitive algorithm is implemented to solve it. Also, an experimental design has been used for tuning essential parameters. The proposed model has been verified by some hypothetical numerical examples with different input parameters and also by a real-world case study taken from a glass mold company. The comparison of results of the proposed genetic imperialist competitive algorithm and the genetic algorithm verifies the efficiency of the proposed solution approach. Also, the results show that the accuracy of the proposed algorithm is comparable with the exact solution methods such as branch and bound algorithm in both solution quality and computational time aspects.

关键词： genetic algorithm imperialist competitive algorithm design of experiments cellular manufacturing

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of distributed energy resources in a distribution system based on imperialist competitive algorithm considering reliability worth

引用

NEURAL COMPUTING & APPLICATIONS 2014年第3-4期25卷 967-974页

作者： Bashiri, M. Great Tehran Elect Distribut Co Tehran Iran Amirkabir Univ Technol Dept Elect Engn Tehran Iran

A model for energy trading in microgrids (MGs) is proposed in this paper. imperialist competitive algorithm is used as a powerful method to determine the optimal schedule of all generation units in MG. The optimal scheduling is determined over a planning horizon considering all the constraints of the MG elements and the load demands. Scheduling of distributed generations (DGs) in the MG affects the risk of blackout in the power system. Therefore, a new objective function is presented to investigate the effect of DGs scheduling on the risk of partial or total blackout. DGs generate the great portion of energy in a MG. Generated power by some of DGs is strongly dependent on the weather and ambient conditions. Therefore, the power generation forecast is the major concern for constructing the model for MG energy trading. In this paper, artificial neural network (ANN) is used to predict hourly power outputs of DGs in the MG. Based on the ANN-based forecast module, the imperialist competitive algorithm is developed to determine the MG scheduling, by which the sources can be managed and an optimal operation can be achieved.

关键词： imperialist competitive algorithm Microgrid Risk of blackout Reliability worth

来源：评论

学校读者我要写书评

暂无评论

Incoherent beam combining based on imperialist competitive algorithm

引用

OPTIK 2018年 168卷 1-9页

作者： Song, Jikun Yang, Guoqing Li, Yuanyang Wang, Tingfeng Chinese Acad Sci State Key Lab Laser Interact Matter Changchun Inst Opt Fine Mech & Phys Changchun 130033 Jilin Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

Incoherent beam combining is an extremely efficient method to achieve high-energy laser output. In this paper, we present the numerical study on the incoherent beam combining using imperialist competitive algorithm (ICA). The feasibility is validated by the simulation of incoherent beam combining system using the ICA under the conditions of free space. The capability of ICA under the different condition of atmosphere turbulence is numerically studied by simulation. It is revealed that ICA is a feasible means for beam combining system even under the condition of strong turbulence. Further, the performance of ICA for incoherent beam combining is compared with a widely used stochastic parallel gradient descent (SPGD) algorithm. The ICA have a small number of iterations and satisfactory correction effect compared with SPGD algorithm. Therefore, the ICA is a promising method for beam combining system. (C) 2018 Elsevier GmbH. All rights reserved.

关键词： Incoherent beam combining imperialist competitive algorithm SPGD algorithm

来源：评论

学校读者我要写书评

暂无评论

A modified imperialist competitive algorithm for digital IIR filter design

引用

OPTIK 2015年第21期126卷 2979-2984页

作者： Sharifi, Mohammad Ali Mojallali, Hamed Islamic Azad Univ Qazvin Branch Dept Elect Comp & Biomed Engn Qazvin Iran Univ Guilan Fac Engn Dept Elect Engn Rasht Iran

There are two major types of digital filters in terms of structure: infinite impulse response (IIR) and finite impulse response (FIR). Digital IIR filters often provide a much better performance and less computational cost than FIR filters and have become the target of growing interest. Since the problem of the error surface of designing digital IIR filters is generally nonlinear and multimodal, global optimization techniques are required in order to avoid local minima. In this paper, an evolutionary method has been proposed to design digital IIR filters. This method is based on imperialist competitive algorithm (ICA) and by adding a step to the existing steps of ICA, performance of it has been improved in searching solution space and convergence to the global minima. Obtained results from simulation using proposed method and other algorithms show that the proposed method is suitable for designing digital IIR filter. (C) 2015 Elsevier GmbH. All rights reserved.

关键词： IIR digital filter Adaptive filter System identification Optimization imperialist competitive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：