Many real-world optimization problems are difficult to solve as they do not possess the nice mathematical properties required by the exact algorithms. Evolutionary algorithms are proven to be appropriate for such problems. In this paper, we propose an improved differential evolution algorithm that uses a mix of different mutation operators. In addition, the algorithm is empowered by a covariance adaptation matrix evolution strategy algorithm as a local search. To judge the performance of the algorithm, we have solved well-known benchmark as well as a variety of real-world optimization problems. The real-life problems were taken from different sources and disciplines. According to the results obtained, the algorithm shows a superior performance in comparison with other algorithms that also solved these problems.
The job-shop scheduling problem is well known for its complexity as an NP-hard problem. We have considered JSSPs with an objective of minimizing makespan while satisfying a number of hard constraints. In this paper, we developed a memetic algorithm (MA) for solving JSSPs. Three priority rules were designed, namely partial re-ordering, gap reduction and restricted swapping, and used as local search techniques in our MA. We have solved 40 benchmark problems and compared the results obtained with a number of established algorithms in the literature. The experimental results show that MA, as compared to GA, not only improves the quality of solutions but also reduces the overall computational time.
10 January 2024 in Swarm and Evolutionary Computation