Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

This paper presents a Shuffled Frog Leaping Algorithm to seek the optimal number and location of FACTS devices in a power system. Unified Power Flow Controller (UPFC) has great flexibility that can control the active and reactive power flow and bus voltages, simultaneously. Decoupled model of the UPFC is applied to maximize the system loadability subject to the transmission line capacity limits...

An effective hybrid cuckoo search algorithm (CS) with improved shuffled frog-leaping algorithm (ISFLA) is put forward for solving 0-1 knapsack problem. First of all, with the framework of SFLA, an improved frog-leap operator is designed with the effect of the global optimal information on the frog leaping and information exchange between frog individuals combined with genetic mutation with a sm...

Article history: Received: 14.5.2015. Received in revised form: 28.11.2015. Accepted: 1.12.2015. Tool travel and tool switch scheduling are two major issues in hole-making operations. It is necessary to find the optimal sequence of operations to reduce the total processing cost of hole-making operations. In this work therefore, an attempt is made to use both a recently developed particle swarm ...

0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.04.151 ⇑ Corresponding author. Tel.: +98 711 7264121; fax E-mail addresses: [email protected] (T. Niknam Firouzi), [email protected] (H.D. Mojarrad). Reduce fossil fuel resources; increasing established new power generation unit costs; and ever growing demand for electric energy necessitate optimal economic dispatc...

In this research, a study was carried out to exploit the hybrid schemes combining two classical local search techniques i.e. Nelder–Mead simplex search method and bidirectional random optimization with two metaheuristic methods i.e. the shuffled frog leaping and the shuffled complex evolution, respectively. In this hybrid methodology, each subset of meta-heuristic algorithms is improved by a hy...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...

: This paper presents an algorithm for solving the multi-objective reactive power dispatch problem in a power system. Modal analysis of the system is used for static voltage stability assessment. Loss minimization and maximization of voltage stability margin are taken as the objectives. Generator terminal voltages, reactive power generation of the capacitor banks and tap changing transformer se...

This study addresses a shuffled frog leaping algorithm for solving the multi-objective reactive power dispatch problem in a power system. Optimal Reactive Power Dispatch (ORPD) is formulated as a nonlinear, multimodal and mixed-variable problem. The intended technique is based on the minimization of the real power loss, minimization of voltage deviation and maximization of the voltage stability...