2026-07-22T08:35:54Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:22258 2024-12-05T15:32:41Z ddc:004 open_access

PACE Solver Description: Martin_J_Geiger Geiger, Martin Josef PACE 2024 one-sided crossing minimization Variable Neighborhood Search Iterated Local Search This extended abstract outlines our contribution to the Parameterized Algorithms and Computational Experiments Challenge (PACE), which invited to work on the one-sided crossing minimization problem. Our ideas are primarily based on the principles of Iterated Local Search and Variable Neighborhood Search. For obvious reasons, the initial alternative stems from the barycenter heuristic. This first sequence (permutation) of nodes is then quickly altered/ improved by a set of operators, keeping the elite configuration while allowing for worsening moves and hence, escaping local optima. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Josef Geiger 2024 Is Part Of LIPIcs, Volume 321, 19th International Symposium on Parameterized and Exact Computation (IPEC 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.IPEC.2024.32 urn:nbn:de:0030-drops-222587 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.32 eng https://creativecommons.org/licenses/by/4.0/legalcode