عنوان انگلیسی مقاله:
Tabu search for min-max edge crossing in graphs
ترجمه فارسی عنوان مقاله:
جستجوی تابو برای عبور از لبه های حداقل حداکثر در گراف ها
Sciencedirect - Elsevier - Computers and Operations Research, 114 (2020) 104830. doi:10.1016/j.cor.2019.104830
Tommaso Pastore a , Anna Martínez-Gavara b , ∗, Antonio Napoletano c , Paola Festa a , Rafael Martíb
Graph drawing is a key issue in the field of data analysis, given the ever-growing amount of information available today that require the use of automatic tools to represent it. Graph Drawing Problems (GDP) are hard combinatorial problems whose applications have been widely relevant in fields such as social network analysis and project management. While classically in GDPs the main aesthetic concern is re- lated to the minimization of the total sum of crossing in the graph (min-sum), in this paper we focus on a particular variant of the problem, the Min-Max GDP, consisting in the minimization of the maximum crossing among all egdes. Recently proposed in scientific literature, the Min-Max GDP is a challenging variant of the original min-sum GDP arising in the optimization of VLSI circuits and the design of in- teractive graph drawing tools. We propose a heuristic algorithm based on the tabu search methodology to obtain high-quality solutions. Extensive experimentation on an established benchmark set with both previous heuristics and optimal solutions shows that our method is able to obtain excellent solutions in short computation time.
Keywords: Combinatorial optimization | Graph drawing | Metaheuristics