C
Colin R. Reeves
Researcher at Coventry University
Publications - 53
Citations - 4698
Colin R. Reeves is an academic researcher from Coventry University. The author has contributed to research in topics: Genetic algorithm & Heuristics. The author has an hindex of 21, co-authored 53 publications receiving 4588 citations.
Papers
More filters
Book
Modern heuristic techniques for combinatorial problems
TL;DR: In this paper, the Lagrangian relaxation and dual ascent tree search were used to solve the graph bisection problem and the graph partition problem, and the traveling salesman problem scheduling problems.
Journal ArticleDOI
Evolutionary computation: a unified approach
TL;DR: Ken De Jong carefully builds up a picture of the influences of selection, mutation and recombination on the behaviour of EAs, and takes a unified approach to EC theory.
Journal ArticleDOI
Genetic algorithms, path relinking, and the flowshop sequencing problem
Colin R. Reeves,Takeshi Yamada +1 more
TL;DR: By taking into account the features of the landscape generated by the operators used, a simple genetic algorithm for finding the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem is improved.
Journal ArticleDOI
Landscapes, operators and heuristic search
TL;DR: The work is developed by investigating the question of how landscapes change under different search operators in the case of the n/m/P/Cmax flowshop problem, and proposing a statistical randomisation test to provide anumerical assessment of the landscape.
Journal ArticleDOI
Constructive and composite heuristic solutions to the P//∑Ci scheduling problem
Jiyin Liu,Colin R. Reeves +1 more
TL;DR: In this article, a new constructive heuristic procedure is proposed to solve the problem of permutation flow shop scheduling with the criterion of minimising the total flow time, which is flexible in the computational effort required, as it can be adjusted to the requirements of the problem.