We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

PURPOSE To report a case of uveitis associated with granuloma annulare (GA). GA is a benign, usually self-limited dermatosis of unknown origin, causing necrobiotic dermal and subcutaneous papules. So far, ocular involvement has not been reported in GA. METHODS We describe a case of uveitis with GA. Ocular examination findings were consistent with uveitis. Histopathologic studies on lower extr...

Artificial bee colony (ABC) algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA), artificial colony optimization (ACO), and particle swarm optimization (PSO). However, the ABC still has some limitations. For example, ABC can easily get trapped ...

There is a variety of knapsack problems in the literature. Multidimensional 0-1 Knapsack Problem (MKP) is an NP-hard combinatorial optimization problem having many application areas. Many approaches have been proposed for solving this problem. In this paper, an empirical investigation of memetic algorithms (MAs) that hybridize genetic algorithms (GAs) with hill climbing for solving MKPs is prov...

The social sciences literature abound in problems of providing and maintaining a public good in a society composed of self-interested individuals 8]. Public goods are social ben-eets that can be accessed by individuals irrespective of their personal contributions. In our previous work we have demonstrated the use of genetic algorithms (GAs) for generating an optimized agent society that can cir...

In terms of goal orientedness, selection is the driving force of Genetic Algorithms (GAs). In contrast to crossover and mutation, selection is completely generic, i.e. independent of the actually employed problem and its representation. GA-selection is usually implemented as selection for reproduction (parent selection). In this paper we propose a second selection step after reproduction which ...

This paper proposes a real-coded predator-prey GA for multiobjective optimization (RCPPGA). The model takes its inspiration from the spatial predator-prey dynamics observed in nature. RCPPGA differs itself from previous similar work by placing a specific emphasis on introducing a dynamic spatial structure to the predator-prey population. RCPPGA allows dynamic changes of the prey population size...

For test-sheet composition systems, it is important to adaptively compose test sheets with diverse conceptual scopes, discrimination and difficulty degrees to meet various assessment requirements during real learning situations. Computation time and item exposure rate also influence performance and item bank security. Therefore, this study proposes an Adaptive Test Sheet Generation ATSG mechani...

This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting methods. To be intent on this a new selection scheme is introduced, which is designed to maintain the genetic diversity within the population by advantageous self-adaptive steering of selection pressure. Additionally this...

Microgrid is one practical infrastructure to integrate Distributed Generations (DGs) and local loads. Its optimal operating strategy has aroused great attention in recent years. This paper mainly focuses on the multi-objective optimization of DGs in microgrid by using self-adaptive genetic algorithm (GA) and fuzzy decision. Five objective functions are taken into account comprising voltage offs...