2 papers
cs.NE2024
Future Trends in the Design of Memetic Algorithms: the Case of the Linear Ordering Problem
Lázaro Lugo, Carlos Segura, Gara Miranda
The way heuristic optimizers are designed has evolved over the decades, as computing power has increased. Such has been the case for the Linear Ordering Problem (LOP), a field in w…
math.OC2021
A Diversity-Aware Memetic Algorithm for the Linear Ordering Problem: Improving Best-Known Solutions for Standard Benchmarks
Lázaro Lugo, Carlos Segura, Gara Miranda
The Linear Ordering Problem (LOP) is a very popular NP-hard combinatorial optimization problem with many practical applications that may require the use of large instances. The Lin…