Now showing items 1-10 of 17
An ant system with direct communication for the capacitated vehicle routing problem.
(University of Manchester., 2011)
An immigrants scheme based on environmental information for ant colony optimization for the dynamic travelling salesman problem.
Ant colony optimization (ACO) algorithms have proved to be powerful methods to address dynamic optimization problems. However, once the population converges to a solution and a dynamic change occurs, it is difficult for ...
Self-adaptation of mutation distribution in evolution strategies for dynamic optimization problems.
(IOS Press., 2011)
Evolution strategies with q-Gaussian mutation, which allows the self-adaptation of the mutation distribution shape, is proposed for dynamic optimization problems in this paper. In the proposed method, a real parameter q, ...
A hybrid evolutionary multiobjective approach for the dynamic component selection problem.
Component selection is a crucial problem in Component Based Software Engineering (CBSE). CBSE is concerned with the assembly of pre-existing software components that leads to a software system that responds to client-specific ...
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 ...
Use of the q-Gaussian mutation in evolutionary algorithms.
This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real ...
Genetic algorithms with guided and local search strategies for university course timetabling.
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 ...
Memory-based immigrants for ant colony optimization in changing environments.
Ant colony optimization (ACO) algorithms have proved that they can adapt to dynamic optimization problems (DOPs) when they are enhanced to maintain diversity. DOPs are important due to their similarities to many real-world ...
Benchmark Generator for the IEEE WCCI-2012 Competition on Evolutionary Computation for Dynamic Optimization Problems
(Brunel University, U.K., 2011-10)
Based on our previous benchmark generator for the IEEE CEC’09 Competition on Dynamic Optimization, this report updates the two benchmark instances where a new change type has been developed as well as a constraint to the ...