https://netotz.github.io/tags/thesis/ Recent content in thesis on void? Hugo -- gohugo.io en Tue, 26 Jul 2022 00:00:00 +0000 https://netotz.github.io/posts/a-fvs/ Tue, 26 Jul 2022 00:00:00 +0000 https://netotz.github.io/posts/a-fvs/ Introduction Earlier in the year I wrote about how the objective function of an optimization problem is decomposed and partially evaluated so an algorithm that uses that function runs faster. I found this technique so interesting that I tried to explain it in that post. But the goal wasn’t to just understand the decomposing of an objective function. I needed to design a fast algorithm to solve the $\alpha$-neighbor $p$-center problem (ANPCP), as I mentioned in the other post, and while researching to do so, I came across the concept of the fast interchange or fast swap and how it was applied to other location problems (not the ANPCP). https://netotz.github.io/posts/decomposing-of/ Tue, 22 Feb 2022 00:00:00 +0000 https://netotz.github.io/posts/decomposing-of/ As the thesis for the BSc Software Engineering, I’m researching heuristic algorithms in the Operations Research field. Specifically, my mentor and I are implementing heuristics for the $\alpha$-neighbor $p$-center problem (ANPCP for short). Because the literature about it is scarce, we’ve been reading papers that use heuristic algorithms for similar problems, and trying to adapt them to the ANPCP. In this process, I found it interesting how some authors decompose the objective function of a problem and evaluate it step by step while, at the same time, applying a heuristic to the current solution.