بهینه سازی کلونی مورچه های ترکیبی رویکردی مبتنی بر برنامه جستجوی محلی برای طراحی بهینه سازی چند هدفه
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|7660||2011||10 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 6907 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Electric Power Systems Research, Volume 81, Issue 4, April 2011, Pages 1014–1023
This paper presents an optimal design of a linear motor considering two objective functions namely, maximum force and minimum saturation and design of air-cored solenoid with maximum inductance and minimum volume as the objective functions. The proposed approach differs from the traditional ones in its design of a multipheromone ant colony optimization (MACO) as well as the inclusion of steady state genetic algorithm (SSGA) and local search approach. Detailed numerical results on different multiobjective design applications are reported. The results obtained by our implementation substantiate the success of this new approach.
The multiobjective or vector optimization is a very important research area in engineering studies because real world design problems require the optimization of a group of objectives. Thanks to the effort of scientists and engineers during the last two decades, particularly the last decade, a wealth of multiobjective optimizers have been developed, and some multiobjective optimization problems that could not be solved hitherto were successfully solved by using these optimizers . In terms of robustness and efficiency of the available vector optimizers, these optimizers are still in need of improvements and hence there are many unresolved open problems . It is also observed that most of the multiobjective optimization studies have been focused on the heuristic algorithms such as genetic (GA) or evolutionary algorithm (EA)  and , particle swarm optimization (PSO) method , simulated annealing algorithm (SA)  and Tabu search method , to name but a few, are proposed and used successfully to solve typical electromagnetic design problems. Recently, to meet the ever increasing demands in the design problems, a new EA called ant colony optimization algorithm have all been used successfully to mimic the corresponding natural, or physical, or social phenomena. Ant colony optimization (ACO) is a metaheuristic inspired by the shortest path searching behavior of various ant species. Since the initial work of Dorigo, Maniezzo, and Colorni on the first ACO algorithm, the ant system , several researchers have designed ACO algorithms to deal with multiobjective problems such as vehicle routing, portfolio selection, Scheduling, among others , , , , , ,  and . Local search techniques have long been used to attack many optimization problems . The basic idea is to start from an initial solution and to search for successive improvements by examining neighboring solutions. The local search used in this paper is based on a dynamic version of pattern search technique. Pattern search technique is a popular paradigm in Direct Search (DS) methods . DS methods, as opposed to more standard optimization methods, are often called derivative-free as they do not require any information about the gradient or higher derivatives of the objective function to search for an optimal solution. Therefore direct search methods may very well be used to solve non-continuous, nondifferentiable and multimodal (i.e. multiple local optima) optimization problems. The linear synchronous motor operates on the same working principle as that of a permanent magnet rotary D.C. motor . As in a rotary motor there are two parts in a LSM, one is the set of permanent magnets and the other is the armature that has conductors carrying current. The permanent magnets produce a magnetic flux perpendicular to the direction of motion. The flow of current is in the direction perpendicular to both the direction of the motion and the direction of the magnetic flux. This paper intends to present an optimal design of a linear motor to replace a hydraulic actuator and design air-cored solenoid using hybrid ant colony optimization approach. This methodology consists of two phases. The first one employs the heuristic search by MACO based on SSGA to obtain near optimal solution, while the other employs efficient local search to improve the solution quality of multiobjective design optimizations. Our approach has several characteristic features. Firstly, the proposed approach implements MACO as a heuristic search technique. Secondly, SSGA is employed for enhancing the ant search. Finally, a dynamic version of pattern search technique was adopted to improve the solution quality of design problems. The remainder of the paper is organized as follows. In Section 2 we describe some preliminaries on multiobjective optimization problem (MOP). In Section 3 we review the standard ACO metaheuristic. In Section 4 we present the proposed approach. Experimental results are given and discussed in Section 5. Section 6 indicates our conclusion and notes for future work.
نتیجه گیری انگلیسی
This paper investigated the optimal design of a linear motor with two objective functions namely, maximum force and minimum saturation, and design of air-cored solenoid with maximum inductance and minimum volume as the objective functions. The proposed approach differs from the traditional ones in its design of a multipheromone ant colony optimization (MACO) as well as the inclusion of steady state genetic algorithm (SSGA) and local search approach. The following are the significant contributions. (a) The proposed approach differs from the traditional ones in its design of a multipheromone ant colony optimization. Several pheromone structures, where, one usually associates a different colony of ants with each different objective, each colony having its own pheromone structure. (b) Improving the multipheromone ant colony optimization by Integration with steady state genetic algorithm and local search approach to improve the quality of the solutions. (c) The numerical results reveal that the proposed approach can find Pareto solutions of multiobjective problems very efficiently and is thus very suitable for engineering multiobjective optimal problems, with no limitation in handing higher dimensional problems. (d) The proposed approach is efficient for solving nonconvex multiobjective optimization problems where multiple Pareto-optimal solutions can be found in one simulation run. Further research will concentrate on the possibilities to extend the proposed technique to deal with real project example, especially in the case of difficult applications (many dimensions, multimodal or discontinuous criteria, etc.). Acknowledgements The author is grateful to the anonymous reviewers for their valuable comments and helpful suggestions which greatly improved the paper's quality.