Comparisons of meta-heuristics for the layered digragh drawing problem
نویسنده
چکیده
In this paper we present a Genetic Algorithm (GA) with problem-specific operators for the layered digraph drawing problem and compare it with two very different meta-heuristics: Tabu search and Multi-start descents. Tabu search has previously proved to be better than the classical deterministic local heuristic often employed in graph drawing. Here, we show on a set of 282 medium-sized graphs that GAs lead to similar results to Tabu for graphs of relatively high density and better results for graphs with medium density. Comparisons with multi-start descents tend to confirm the good quality of the solutions found by using GAs. Key-Words: meta-heuristics, combinatorial optimization, graph drawing, genetic algorithm, tabu search, multistart descents
منابع مشابه
Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملA Descriptive Analysis of a Landscape for a Directed Graph Layout Problem
Generally speaking, the problem of drawing a graph G is set as a combinatorial optimization problem: producing a layout L(G) of G on a given support according to a drawing convention (e.g. layered drawing) that optimizes some measurable aesthetics (e.g. arc-crossing). Numerous criteria lead to NP-complete problems, and aesthetics often conflict with each other. Hence, various heuristics from cl...
متن کاملA Comparison of Four Multi-Objective Meta-Heuristics for a Capacitated Location-Routing Problem
In this paper, we study an integrated logistic system where the optimal location of depots and vehicles routing are considered simultaneously. This paper presents a new mathematical model for a multi-objective capacitated location-routing problem with a new set of objectives consisting of the summation of economic costs, summation of social risks and demand satisfaction score. A new multi-objec...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کامل