Cemre Cubukcuoglu 1, Ioannis Chatzikonstantinou 2,3, Mehmet Fatih Tasgetiren 4,*, I. Sevil Sariyildiz 2,3 and Quan-Ke Pan 5 1 Department of Interior Architecture and Environmental Design, Yasar University, Izmir 35100, Turkey; [email protected] 2 Department of Architecture, Yasar University, Izmir 35100, Turkey; [email protected] (I.C.); [email protected]...

This paper deenes a class of evolutionary algorithms called evolutionary pattern search algorithms (EPSAs) and analyzes their convergence properties. This class of algorithms is closely related to evolutionary programming, evolution strategie and real-coded genetic algorithms. EPSAs are self-adapting evolutionary algorithms that modify the step size of the mutation operator in response to the s...

Evolutionary computation in its essense represents a multi-agent competitive probabilistic search. It is useful for solutions of polynomial and hard optimization problems. The solutions found by evolutionary algorithms are not guaranteed to be optimal and evolutionary search is computationally very expensive. Using a generic $-calculus approach to AI, based on process algebras and anytime algor...

We review how computational search techniques inspired by biological evolution have been used to discover quantum circuits and quantum algorithms. We discuss issues in representing quantum artefacts in a form suitable for evolutionary search, various quantum artefacts that have been discovered through evolutionary search, and future prospects for this approach. keywords: quantum algorithms, heu...

Cemre Cubukcuoglu 1, Ioannis Chatzikonstantinou 2,3, Mehmet Fatih Tasgetiren 4,*, I. Sevil Sariyildiz 2,3 and Quan-Ke Pan 5 1 Department of Interior Architecture and Environmental Design, Yasar University, Izmir 35100, Turkey; [email protected] 2 Department of Architecture, Yasar University, Izmir 35100, Turkey; [email protected] (I.C.); [email protected]...

This paper discusses a series of recombination operators for the timetabling problem. These operators act upon a direct representation of the timetable and maintain the property of feasibility. That is that there are no conflicts and no overfilled rooms. Various approaches to solving the timetabling problem using evolutionary computing methods are first compared. The recombination operators are...

This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hybrid approach. On the one hand an evolutionary algorithm searches the space of all permutations of the events from which a timetable builder generates the school timetables. Those timetables are further optimized by lo...

This paper illustrates an evolutionary algorithm for drawing graphs according to a number of esthetic criteria. Tests are carried out on three graphs of increasing diiculty and the performance of four diier-ent recombination operators are compared. The results are then brieey discussed and compared to those obtained with a tabu search.

This paper summarizes the research on population based probabilistic search algorithms based on modeling promising solutions by estimating their probability distribution and using the constructed model to guide the further exploration of the search space It settles the algorithms in the eld of genetic and evolutionary computation where they have been originated All methods are classi ed into a ...