-
An efficient evolutionary algorithm for the orienteering problem
Kobeaga, G.
; Merino, M.; Lozano, J.A. (2017-09-06)
This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject ...
-
A General Framework Based on Walsh Decomposition for Combinatorial Optimization Problems
Unanue, I.; Merino, M.; Lozano, J.A. (2021-01-01)
In this paper we pursue the use of the Fourier transform for a general analysis of combinatorial optimization problems. While combinatorial optimization problems are defined by means of different notions like weights in a ...
-
A mathematical analysis of EDAs with distance-based exponential models
Unanue, I.; Merino, M.; Lozano, J.A. (2022-09-01)
Estimation of Distribution Algorithms have been successfully used to solve permutation-based Combinatorial Optimization Problems. In this case, the algorithms use probabilistic models specifically designed for codifying ...
-
A mathematical analysis of edas with distance-based exponential models
Unanue, I.; Merino, M.; Lozano, J.A. (2019-07-01)
Estimation of Distribution Algorithms have been successfully used for solving many combinatorial optimization problems. One type of problems in which Estimation of Distribution Algorithms have presented strong competitive ...
-
On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms
Kobeaga, G.; Merino, M.; Lozano, J.A. (2021-01-01)
In this paper, we extend techniques developed in the context of the Travelling Salesperson Problem for cycle problems. Particularly, we study the shrinking of support graphs and the exact algorithms for subcycle elimination ...
-
A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
Aldasoro, U.; Escudero, L.F.; Merino, M.; Pérez, G. (2016-08-26)
A parallel matheuristic algorithm is presented as a spin-off from the exact Branch-and-Fix Coordination (BFC) algorithm for solving multistage stochastic mixed 0-1 problems. Some steps to guarantee the solution’s optimality ...