Now showing items 1-4 of 4
Hyper-selection in dynamic environments.
In recent years, several approaches have been developed for genetic algorithms to enhance their performance in dynamic environments. Among these approaches, one kind of methods is to adapt genetic operators in order for ...
Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks.
In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), ...
A hybrid genetic algorithm and inver over approach for the travelling salesman problem.
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded local search scheme. Within the SBGA, a ...
A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling.
(Springer Science & Business, 2011)
The post enrolment course timetabling problem (PECTP) is one type of university course timetabling problems, in which a set of events has to be scheduled in time slots and located in suitable rooms according to the student ...