Nowadays, a promising way to obtain hybrid metaheuristics concerns the combination of
several search algorithms with strong specialization in intensification and/or diversification …

Bat algorithm (BA) is a heuristic optimization algorithm based on swarm intelligence and the
inspiration from the nature behavior of bats. It has some advantages including fast solving …

This research deals with the single machine scheduling problem (SMSP) with uncertain job
processing times. The single machine robust scheduling problem (SMRSP) aims to obtain …

Many real world problems, such as circuit designing and planning, can be encoded into the
maximum satisfiability problem (MAX-SAT). To solve MAX-SAT, many effective local search …

6,289,502 B1* 9/2001 Garland et al................ T17, 104 represented with a finite State
machine. Attempt to solve a 6,385,769 B1* 5/2002 Lewallen........ 717? 125 Solution for the …

This paper presents the first fitness landscape analysis on the delay-constrained least-cost
multicast routing problem (DCLC-MRP). Although the problem has attracted an increasing …

In this study, we address a rescheduling problem in parallel machine environments under
machines failures. To make a balance between efficiency and stability of the reschedules …

One of the imperative tasks of universities, which is usually challenging, are university
course timetabling problems. These problems are confronted with, every year and term and …

A hyperheuristic is a heuristic that performs a search over a set of low-level heuristics for
solving difficult problems. A perturbative hyperheuristic consists of two successive stages. In …

Iterative Local search methods have the characteristic of obtaining decent solution with short
or acceptable time for job shop scheduling problems. They improve solution by search …