Graph drawing using tabu search coupled with path relinking.
Graph drawing, or the automatic layout of graphs, is a challenging problem. There are several search based methods for graph drawing which are based on optimizing an objective function which is formed from a weighted sum of multiple criteria. In this paper, we propose a new neighbourhood search meth...
Main Authors: | Fadi K Dib, Peter Rodgers |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2018-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5945037?pdf=render |
Similar Items
-
A hybridization of granular adaptive tabu search with path relinking for the multi-depot open vehicle routing problem
by: Wenhan Shao, et al.
Published: (2023-12-01) -
Graph drawing using Jaya
by: Fadi K. Dib, et al.
Published: (2023-01-01) -
aPaRT: A Fast Meta-Heuristic Algorithm using Path-Relinking and Tabu Search for Allocating Machines to Operations in FJSP Problem
by: Hamid Jazayeriy, et al.
Published: (2018-05-01) -
Efficient Multi-Start With Path Relinking Search Strategy for Transmission System Expansion Planning
by: Silvia M. L. Silva, et al.
Published: (2021-01-01) -
Heuristic methods using grasp, path relinking and variable neighborhood search for the clustered traveling salesman problem
by: Mário Mestria
Published: (2013-08-01)