Search
Now showing items 1-10 of 15
Hybrid meta-heuristic algorithms for independent job scheduling in grid computing
(Elsevier, 2018-05-26)
The term ’grid computing’ is used to describe an infrastructure that connects geographically distributed computers and heterogeneous platforms owned by multiple organizations allowing their computational power, storage ...
Adaptive mutation with fitness and allele distribution correlation for genetic algorithms
(ACM Press, 2006)
In this paper, a new gene based adaptive mutation scheme is proposed for genetic algorithms (GAs), where the information on gene based fitness statistics and on gene based allele distribution statistics are correlated to ...
Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks.
(IEEE, 2010)
In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, ...
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks.
(IFAC, the International Federation of Automatic Control, 2010)
In this paper, the problem of dynamic quality-of-service (QoS) multicast routing in mobile ad hoc networks is investigated. Lots of interesting works have been done on multicast since it is proved to be a NP-hard problem. ...
Experimental study on population-based incremental learning algorithms for dynamic optimization problems
(Springer, 2005-11-01)
Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world problems are often dynamic. This seriously challenges traditional evolutionary algorithms. In this ...
Genetic algorithms with guided and local search strategies for university course timetabling.
(IEEE, 2011)
The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable rooms. The design of course timetables for ...
Associative memory scheme for genetic algorithms in dynamic environments
(Springer, 2006)
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems, of which the memory scheme is a major ...
A memetic algorithm for the university course timetabling problem.
(IEEE., 2008)
The design of course timetables for academic institutions is a very hectic job due to the exponential number of possible feasible timetables with respect to the problem size. This process involves lots of constraints that ...
Adaptive group mutation for tackling deception in genetic search
(WSEAS, 2004-01-01)
In order to study the efficacy of genetic algorithms (GAs), a number of fitness landscapes have been designed and used as test functions. Among these functions a family of deceptive functions have been developed as difficult ...
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods.
(World Federation on Soft Computing (WFSC), 2011)
In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the ...
