摘要
This paper introduces a new evaluation function, called , for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical evaluation function used, our function is much more discriminating and leads to smoother landscapes. The main characteristics of are analyzed and its practical usefulness is assessed within a Simulated Annealing algorithm. Experiments show that thanks to the use of the function, we are able to improve on some previous best results of a set of well-known benchmarks. Keywords: Bandwidth Evaluation Function, Bandwidth Minimization Problem, Heuristics, Simulated Annealing.