'Memetic Algorithms in Planning, Scheduling, and Timetabling' published in 'Evolutionary Scheduling'
scholar.google.com › citations
Memetic algorithms address the difficulty of developing high-performance universal heuristics by encouraging the exploitation of multiple heuristics acting in ...
Memetic algorithms (MAs) constitute a metaheuristic op- timization paradigm based on the systematic exploitation of knowledge about the problem being solved, ...
The basic architecture of a MAs is described, and some guidelines to the design of a successful MA for these applications are presented, as well as some ...
ABSTRACT We face the job shop scheduling problem with sequence dependent setup times and makespan minimization by memetic algorithm. This algorithm combines a ...
People also ask
What is the memetic algorithm?
Which is the best process scheduling algorithm?
Abstract- Course timetabling problems are real world constraint optimization problems that are often coped with in educational institutions, ...
Missing: Planning, | Show results with:Planning,
Memetic algorithms employ local search, which serves as an effective intensification mechanism that is very useful when using sophisticated representation ...
In this Sect., we discuss the strategies that have been used more frequently by researchers and practitioners when designing memetic algorithms for scheduling ...
In this paper we present such a hybrid approach in the form of an evolutionary algorithm that incorporates local search methods (known as a memetic algorithm).
The timetabling problems are well known complicated constraint satisfaction problems. A new real-world course timetabling problem is described in this study ...