A constructive parallel heuristic approach for the MWPSP-Reference-Cited by-同舟云学术

A constructive parallel heuristic approach for the MWPSP

Published:2023-10-17 Issue: Volume: Page:289-300
ISSN:
Container-title:Anais do XXIV Simpósio em Sistemas Computacionais de Alto Desempenho (SSCAD 2023)
language:
Short-container-title:

Author:

Silva Rafael C.,Coelho Vinicius,Martins Wellington,Longo Humberto,Foulds Leslie

Abstract

Algorithms for the problem of identifying a maximum edge-weight planar subgraph of a given edge-weighted graph G are relevant in a wide variety of application areas. In this paper, we propose a new local search constructive heuristic for this NP-hard problem, along with a GPU-based algorithm designed to accelerate its computational process. The experimental findings demonstrated that considerable speedup is attainable while maintaining good-quality results.

Publisher

Sociedade Brasileira de Computação

Reference15 articles.

1. Ahmadi-Javid, A., Ardestani-Jaafari, A., Foulds, L. R., Hojabri, H., and Farahani, R. Z. (2015). An algorithm and upper bounds for the weighted maximal planar graph problem. Journal of the Operational Research Society, 66(8):1399–1412.

2. Alexander, J. W. (1930). The combinatorial theory of complexes. Annals of Mathematics, 31(2):292–320.

3. Coelho, V. S., Martins, W. S., Foulds, L. R., Dias, E. S., Castonguay, D., and Longo, H. J. (2016). Uma proposta de solução aproximada para o problema do subgrafo planar de peso máximo. In XVII Simpósio em Sistemas Computacionais de Alto Desempenho (WSCAD 2016), pages 16–27.

4. Easley, D. and Kleinberg, J. (2010). Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, Cambridge, UK.

5. Foulds, L. R. and Robinson, D. F. (1978). Graph theoretic heuristics for the plant layout problem. International Journal of Production Research, 16(1):27–37.