جستجوی مقالات مرتبط با کلیدواژه
تکرار جستجوی کلیدواژه imperialist competitive algorithm در نشریات گروه فنی و مهندسی
imperialist competitive algorithm
در نشریات گروه مواد و متالورژی
تکرار جستجوی کلیدواژه imperialist competitive algorithm در مقالات مجلات علمی
-
In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, this proposed mathematical model has suitable efficiency for solving small instances. Two versions of imperialist competitive algorithm (ICA) are presented to heuristically solve the problem. The grouping version of algorithm (G-ICA) is used to solve the large-sized instances based on considering the allocation of trucks as a grouping problem. Effectiveness of the proposed metaheuristics on small-sized problems is compared with the optimal results of the mathematical model. In order to compare the efficiency of the proposed algorithms for large-sized instances, several instances were generated and solved, and the performance of algorithms has been compared with each other. Moreover, a simulated annealing (SA) algorithm is developed to solve the problem and evaluate the performance of the proposed ICA algorithms. Based on the experimental results, the G-ICA has a better performance compared to the ICA and SA. Also an instance of a container terminal in Iran has been investigated which shows that the proposed model and solution methods are applicable in real-world problems.Keywords: Grouping, Imperialist Competitive Algorithm, mathematical model, non-crossing, quay crane scheduling, yard truck scheduling
-
Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of cluster heads are two important issues. Many routing protocols are introduced to discover the optimal routes in order to remove intermediate nodes to reduce the sensors energy consumption. Therefore, for energy consumption optimization in a network, routing protocols and clustering techniques along with composition and aggregation of data are provided. In this paper, to design a hierarchy topology, a hybrid evolutionary approach, a combination of genetic and imperialist competition algorithms is applied. First, the genetic algorithm is applied to achieve an optimal clusters number where all effective network parameters are taken in into account. Aftermath, the optimal positions of cluster heads inside every cluster are calculated utilizing the imperialist approach. Our results show a significant increment in the network lifetime, lower data-packet lost, higher robust routing compared with standard LEACH and the ICA based LEACH.Keywords: Wireless Sensor Networks, LEACH Algorithm, Genetic Algorithm, Imperialist Competitive Algorithm, Network Lifetime
-
در این مقاله، مقادیر بهینه ی پارامترهای موثر بر توزیع تنش اطراف گشودگی پنج ضلعی واقع در صفحه ارتوتروپیک تحلیل و بررسی می شوند. برای تعیین پارامترهای بهینه به منظور دست یابی به کمترین مقدار تنش در اطراف گشودگی از الگوریتم بهینه سازی رقابت استعماری استفاده شده است. الگوریتم رقابت استعماری روشی در حوزه محاسبات تکاملی است که به یافتن پاسخ بهینه مسائل می پردازد. این الگوریتم با تقلید از روند تکامل اجتماعی، اقتصادی و سیاسی کشورها و با مدل سازی ریاضی بخش هایی از این فرآیند، عملگرهایی را در قالب منظم به صورت الگوریتم ارائه می دهد که می توانند به حل مسائل پیچیده بهینه سازی کمک کنند. پایه های اصلی این الگوریتم را سیاست هم سان سازی، رقابت استعماری و انقلاب تشکیل می دهند. در واقع این الگوریتم جواب های مسئله ی بهینه سازی را در قالب کشورها نگریسته و سعی می کند در طی فرآیندی تکرار شونده این جواب ها را رفته رفته بهبود داده و در نهایت به جواب بهینه مسئله برساند. روش استفاده شده در این مقاله، بسط روش تحلیلی است که برای گشودگی دایروی و بیضوی توسط لخنیتسکی انجام شده است. متغیرهای طراحی در این پژوهش شامل زاویه الیاف، زاویه ی بار، شعاع انحنای گوشه گشودگی، زاویه چرخش گشودگی و در نهایت جنس صفحه می باشد. نتایج حاصل شده از الگوریتم بهینه سازی رقابت استعماری بیانگر مناسب بودن این روش در بهینه سازی صفحات ارتوتروپیک می باشد. برای اثبات درستی نتایج، از حل عددی اجزای محدود استفاده شده است. نتایج نشان می دهند با انتخاب مناسب پارامترهای بهینه می توان مقدار تنش اطراف گشودگی را به میزان قابل توجهی کاهش داد.کلید واژگان: صفحه ارتوتروپیک نامحدود، الگوریتم رقابت استعماری، گشودگی پنج ضلعی، حل تحلیلیOne of the designers concerns is structural failure as a result of stress concentration in the geometrical discontinuities. Understanding the effective parameters on stress concentration and proper selection of these parameters enables the designer to achieve a reliable design. In the analysis of perforated orthotropic plate, the effective parameters on stress distribution around cutouts include fiber angle, load angle, curvature radius of the corner of the cutout, rotation angle of the cutout and at last material of the plate. This paper tries to examine effective parameters on stress analysis of infinite orthotropic plate with central pentagonal cutout with imperialist competitive algorithm (ICA) introduced the optimum parameters to achieve the least amount of stress around the cutout. Like other evolutionary algorithms, ICA is becoming an important tool for optimization and other complex problem solving. The results reported in this review provide evidence of performance achievement of the ICA in terms of both computing time and quality of solution. In this paper, an analytical method has been used to Lekhnitskii theory for circular and elliptical cutouts. Finite element numerical solution is employed to examine the results of present analytical solution. Overlap of the results of the two methods confirms the validity of the presented solution. Results show that by selecting the aforementioned parameters properly, less amounts of stress could be achieved around the cutout leading to an increase in load-bearing capacity of the structure.Keywords: Perforated Plates, Pentagonal Cutout, Imperialist Competitive Algorithm, Analytical solution
-
There are two types of digital filters including Infinite Impulse Response (IIR) and Finite Impulse Response (FIR). IIR filters attract more attention as they can decrease the filter order significantly compared to FIR filters. Owing to multi-modal error surface, simple powerful optimization techniques should be utilized in designing IIR digital filters to avoid local minimum. Imperialist competitive algorithm is an evolutionary algorithm used in solving optimization problems in recent years. It can find global optimum response in a nonlinear searching space. In this paper, performance of chaotic orthogonal imperialist competitive algorithm has been improved through some variations in it. Then, this modified algorithm has been applied in designing IIR digital filters and their performance has been compared to some evolutionary algorithms.Keywords: IIR Digital Filter, Imperialist Competitive Algorithm, Optimization, Evolutionary Algorithm
-
The allocation of design tolerances between the components of a mechanical assembly and manufacturing tolerances can significantly affect the functionality of products and related production costs. This paper introduces Imperialist Competitive Algorithm (ICA) approach to solve the machining tolerance allocation of an overrunning clutch assembly. The objective is to obtain optimum tolerances of the individual components for the minimum cost of manufacturing. The results of ICA were finally compared with the Genetic Algorithm (GA). Based on the results, ICA has demonstrated excellent capabilities such as accuracy, faster convergence and better global optimum achievement.Keywords: Imperialist Competitive Algorithm, clutch assembly
-
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective function. As telecommunications, manufacturing and power systems are becoming more and more complex, while requiring short developments schedules and very high reliability, it is becoming increasingly important to develop efficient solutions to the RAP. In this paper, a new hybrid multi-objective imperialist competition algorithm (HMOICA) based on imperialist competitive algorithm (ICA) and genetic algorithm (GA) is proposed for the first time in multi-objective redundancy allocation problems. In the multi-objective formulation, the system reliability is maximized while the cost and volume of the system are minimized simultaneously. Additionally, a response surface methodology (RSM) is employed to tune the ICA parameters. The proposed HMOICA is validated by some examples with analytical solutions. It shows its superior performance compared to a non-dominated sorting genetic algorithm (NSGA-II) and Pareto archive evolution strategy algorithm (PAES). Finally, the conclusion is given.Keywords: Redundancy allocation problem, Response surface methodology, Multi, objective optimization, Imperialist competitive algorithm
نکته
- نتایج بر اساس تاریخ انتشار مرتب شدهاند.
- کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شدهاست. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
- در صورتی که میخواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.