Local Optima Networks with Escape Edges
This paper proposes an alternative definition of edges (escape edges) for the recently introduced network-based model of combinatorial landscapes: Local Optima Networks (LON). The model compresses the information given by the whole search space into a smaller mathematical object that is the graph having as vertices the local optima and as edges the possible weighted transitions between them. The original definition of edges accounted for the notion of transitions between the basins of attraction of local optima. This definition, although informative, produced densely connected networks and required the exhaustive sampling of the basins of attraction. The alternative escape edges proposed here do not require a full computation of the basins. Instead, they account for the chances of escaping a local optima after a controlled mutation (e.g. 1 or 2 bit-flips) followed by hill-climbing. A statistical analysis comparing the two LON models for a set of NK landscapes, is presented and discussed. Moreover, a preliminary study is presented, which aims at validating the LON models as a tool for analyzing the dynamics of stochastic local search in combinatorial optimization.
KeywordsSearch Space Local Search Local Optimum Iterate Local Search Local Search Heuristic
Unable to display preview. Download preview PDF.
- 3.Csardi, G., Nepusz, T.: The igraph software package for complex network research. InterJournal Complex Systems, 1695 (2006)Google Scholar
- 5.Kauffman, S.A.: The Origins of Order. Oxford University Press, New York (1993)Google Scholar
- 6.Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 321–353. Kluwer Academic Publishers (2002)Google Scholar