3 papers
cs.NE2019
A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem
Mehdi El Krari, Belaïd Ahiod
The Travelling Salesman Problem (TSP) is one of the most popular Combinatorial Optimization Problem. It is well solicited for the large variety of applications that it can solve, b…
cs.AI2018
On the performance of multi-objective estimation of distribution algorithms for combinatorial problems
Marcella S. R. Martins, Mohamed El Yafrani, Roberto Santana +3
Fitness landscape analysis investigates features with a high influence on the performance of optimization algorithms, aiming to take advantage of the addressed problem characterist…
cs.AI2016
Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem
Mohamed El Yafrani, Belaïd Ahiod
Real-world problems are very difficult to optimize. However, many researchers have been solving benchmark problems that have been extensively investigated for the last decades even…