Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme

What is it about?

Many discrete optimization. problems belong to the class of NP-hard problems. Therefore, a number of heuristic algorithms has been developed for these problems. As regards iteration methods, the determination of a suitable neighbourhood has a special importance. In this paper, we consider several neighbourhood structures which can be used to solve such problems iteratively, where the set of solutions is given by the set of permutations of m elements (i.e., jobs), Based on some introduced neighbourhood graphs, we derive some properties of these structures.

Featured Image

Why is it important?

It gives some indication how neighborhoods should be appropriately defined.