文章基本信息

标题：Computing strong metric dimension of some special classes of graphs by genetic algorithms
本地全文：下载
作者：Kratica Jozef ; Kovačević-Vujčić Vera ; Čangalović Mirjana 等
期刊名称：Yugoslav Journal of Operations Research
印刷版ISSN：0354-0243
电子版ISSN：1820-743X
出版年度：2008
卷号：18
期号：2
页码：143-151
DOI：10.2298/YJOR0802143K
出版社：Faculty of Organizational Sciences, Belgrade, Mihajlo Pupin Institute, Belgrade, Economics Institute, Belgrade, Faculty of Transport and Traffic Engineering, Belgrade, Faculty of Mechanical Engineering, Belgrade
摘要：
In this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses binary encoding and standard genetic operators adapted to the problem. This represents the first attempt to solve this problem heuristically. We report experimental results for the two special classes of ORLIB test instances: crew scheduling and graph coloring.
关键词：strong metric dimension; genetic algorithms; evolutionary approach