Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
In this paper, a new model of Probabilistic Model-Building Genetic Algorithms (PMBGAs), Distributed PMBGA (DPMBGA), is proposed. In the DPMBGA, the correlation among the design var...
In a two-market genetic algorithm applied to a constrained optimization problem, two ‘markets’ are maintained. One market establishes fitness in terms of the objective functio...
Steven Orla Kimbrough, Ming Lu, David Harlan Wood,...
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Abstract. We analyze the convergence properties of our force based genetic algorithm(fga) as a decentralized topology control mechanism distributed among software agents. fga guide...
Cem Safak Sahin, Stephen Gundry, Elkin Urrea, M. &...