نتایج جستجو برای: improved imperialist competitive algorithm
تعداد نتایج: 1226928 فیلتر نتایج به سال:
This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NP-hard, metaheuristic algorithms are proper to solve this class of problems. Hence, in this 1 / 4
In this paper, the optimal design of supplementary controller parameters of a unified power flow controller (UPFC) to damp low-frequency oscillations in a weakly connected system is investigated. The individual design of the UPFC controller, using the imperialist competitive algorithm (ICA) technique over a wide range of operating conditions, is discussed. The effectiveness and validity of the ...
In aviation industry, considering more freedom in the selection and modification of flight paths during flight time is a new challenge, which is known as free flight. The free flight concept alters the current centralized and command-control airspace system (between air traffic controllers and pilots) to a distributed system that allows pilots choose their own flight paths more efficient and op...
This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...
This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...
In this paper a new evolutionary computing method based on imperialist competitive algorithm (ICA) is used for tuning the parameters of a PID controller which is applied in a load frequency control system (LFC) in a multi area electric power system. If a large power imbalance is suddenly happened in a multi area power electric system, generation units and also consumer sides will be affected by...
In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...
The steady-state stability limit and the system positive damping can be improved by conventional Power System Stabilizer (PSS). However, in order to have abilities such as the online tuning and optimal real-time damping in the entire operating range, robust design of PSS in required. A novel robust PSS design using Artificial Neural Network (ANN) and Imperialist Competitive Algorithm (ICA) for ...
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 functi...
In aviation industry, free flight is a new concept which implies considering more freedom in the selection and modification of flight paths during flight time. The free flight concept allows pilots choose their own flight paths more efficient, and also plan for their flight with high performance. Although free flight has many advantages such as minimum delays and the reduction of the workload o...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید