Advertisement

Fitness Landscape Analysis of NK Landscapes and Vehicle Routing Problems by Expanded Barrier Trees

  • Bas van Stein
  • Michael Emmerich
  • Zhiwei Yang
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 227)

Abstract

Combinatorial landscape analysis (CLA) is an essential tool for understanding problem difficulty in combinatorial optimization and to get a more fundamental understanding for the behavior of search heuristics. Within CLA, Barrier trees are an efficient tool to visualize essential topographical features of a landscape. They capture the fitness of local optima and how they are separated by fitness barriers from other local optima. The contribution of this study is two-fold: Firstly, the Barrier tree will be extended by a visualization of the size of fitness basins (valleys below saddle points) using expandable node sizes for saddle points and a graded dual-color scheme will be used to distinguish between penalized infeasible and non-penalized feasible solutions of different fitness. Secondly, fitness landscapes of two important NP hard problems with practical relevance will be studied: These are the NK landscapes and Vehicle Routing Problems (with time window constraints). Here the goal is to use EBT to study the influence of problem parameters on the landscape structure: for NK landscapes the number of interacting genes K and for Vehicle Routing Problems the influence of the number of vehicles, the capacity and time window constraints.

Keywords

Search Space Saddle Point Local Optimum Vehicle Route Problem Infeasible Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Altenberg, L.: Nk-fitness landscapes. In: Bäck, T., et al. (eds.) Handbook of Evolutionary Computation. Oxford University Press (1997)Google Scholar
  2. 2.
    Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management Science 6(1), 80–91 (1959)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Flamm, C., Hofacker, I.L., Stadler, P.F., Wolfinger, M.T.: Barrier trees of degenerate landscapes. Zeitschrift für Physikalische Chemie 216, 155 (2002)CrossRefGoogle Scholar
  4. 4.
    Gambardella, L.M., Taillard, É., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: New Ideas in Optimization, ch. 5, pp. 63–76. McGraw-Hill (1999)Google Scholar
  5. 5.
    Kallehauge, B., Larsen, J., Madsen, O.B.G., Solomon, M.M.: Vehicle routing problem with time windows. Column Generation, 67–98 (2005)Google Scholar
  6. 6.
    Kauffman, S.A.: The origins of order: Self-organization and selection in evolution. Oxford University Press, USA (1993)Google Scholar
  7. 7.
    Li, R., Emmerich, M.T.M., Eggermont, J., Bovenkamp, E.G.P., Bäck, T., Dijkstra, J., Reiber, J.H.C.: Mixed-integer nk landscapes. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 42–51. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Ochoa, G., Tomassini, M., Vérel, S., Darabos, C.: A study of nk landscapes’ basins and local optima networks. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 555–562. ACM (2008)Google Scholar
  9. 9.
    Prusinkiewicz, P., Lindenmayer, A.: The algorithmic beauty of plants. Springer (1996)Google Scholar
  10. 10.
    Rammal, R., Toulouse, G., Virasoro, M.A.: Ultrametricity for physicists. Reviews of Modern Physics 58(3), 765 (1986)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Stadler, P.: Towards a theory of landscapes. In: Complex Systems and Binary Networks. Lecture Notes in Physics, vol. 461, pp. 78–163. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  12. 12.
    Strahler, A.N.: Quantitative analysis of watershed geomorphology. Transactions of the American Geophysical Union 38(6), 913–920 (1957)CrossRefGoogle Scholar
  13. 13.
    Tomassini, M., Daolio, F.: A complex-networks view of hard combinatorial search spaces. In: Tantar, E., Tantar, A.-A., Bouvry, P., Del Moral, P., Legrand, P., Coello Coello, C.A., Schütze, O. (eds.) EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation. SCI, vol. 447, pp. 221–244. Springer, Heidelberg (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  1. 1.LIACSLeiden UniversityLeidenThe Netherlands

Personalised recommendations