Document Open Access Logo

PACE Solver Description: Martin_J_Geiger

Author Martin Josef Geiger

PDF

File

Thumbnail PDF
PDF
LIPIcs.IPEC.2024.32.pdf
  • Filesize: 0.52 MB
  • 4 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Optimization with randomized search heuristics
Keywords
  • PACE 2024
  • one-sided crossing minimization
  • Variable Neighborhood Search
  • Iterated Local Search

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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.

Cite As Get BibTex

Martin Josef Geiger. PACE Solver Description: Martin_J_Geiger. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 321, pp. 32:1-32:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.IPEC.2024.32

Author Details

Martin Josef Geiger
  • University of the Federal Armed Forces Hamburg, Germany

Acknowledgements

We would like to thank the organizers of PACE 2024, namely Philipp Kindermann, Fabian Klute, and Soeren Terziadis, for working really hard for this interesting competition. Besides, our thanks go to the sponsors NETWORKS (https://www.thenetworkcenter.nl/) and the wonderful platform https://optil.io.

Supplementary Materials

References

  1. Vida Dujmović, Henning Fernau, and Michael Kaufmann. Fixed parameter algorithms for one-sided crossing minimization revisited. Journal of Discrete Algorithms, 6:313-323, 2008. Google Scholar
  2. Pierre Hansen and Nenad Mladenović. Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130:449-467, 2001. URL: https://doi.org/10.1016/S0377-2217(00)00100-4.
  3. Patrick Healy and Nikola S. Nikolov. Hierarchical drawing algorithm. In Roberto Tamassia, editor, Handbook of Graph Drawing and Visualization, Discrete Mathematics and its Applications, chapter 13, pages 409-453. CRC Press - Taylor Francis Group, Boca Raton, FL, USA, June 2013. Google Scholar
  4. Donald B. Johnson. Finding all elementary circuits in a directed graph. SIAM Journal on Computing, 4(1):77-84, 1975. Google Scholar
  5. Helena R. Lourenço, Olivier Martin, and Thomas Stützle. Iterated local search. In Fred Glover and Gary A. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, chapter 11, pages 321-353. Kluwer Academic Publishers, Boston, Dordrecht, London, 2003. URL: https://doi.org/10.1007/0-306-48056-5_11.
  6. Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, SMC-11(2):109-125, February 1981. URL: https://doi.org/10.1109/TSMC.1981.4308636.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact