in this paper proposes a fuzzy multi-objective hybrid genetic and bee colony optimization algorithm(ga-bco) to find the optimal restoration of loads of power distribution network under fault.restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. to improve the efficiency of restoration and facilitate theactivity...

This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalability on the one hand, and that fight premature convergence on the other hand, this paper presents two extensions of the standard genetic algorithm without introducing any problem specific knowledge, as done in many probl...

The maximum clique problem (MCP) is to determine a sub graph of maximum cardinality. A clique is a The corresponding optimization problem i.e. finding the maximum Maximum Clique Problem. in Handbook of Combinatorial. Common theme of every optimization problem: of semidefinite programming, A module on combinatorial optimization, Selected topics: The largest clique (i.e., complete subgraph)! In “...

Computer-aided process planning represents the main link between computer-aided design and manufacturing. One of crucial tasks in is an operation sequencing problem. In order to find optimal plan, problem formulated as NP hard combinatorial To solve this problem, a novel genetic crow search approach (GCSA) proposed paper. The traditional CSA improved by employing strategies such tournament sele...

Network reconfiguration is a combinatorial optimization problem because it accounts various operational constraints in distribution systems. Plant Growth Simulation Algorithm has emerged as a useful optimization tool for handling nonlinear programming problems. In this paper, Plant Growth Simulation Algorithm has been proposed with a view to enhance speed and robustness. This method has been ap...