In this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly resolving set with the minimum cardinality. Both are present in many diverse areas, including network discovery and verification, robot...

It has been shown that evolutionary algorithms are able to construct suitable search strategies for classes of Constraint Satisfaction Problems (CSPs) in Constraint Programming. This paper is an explanation of the use of multi-objective optimisation in contrast to simple additive weighting...