Abstract
There is an increasing interest of research in combinatorial optimization to understand the interaction of local search and the structure of fitness landscapes. However, the methods developed to analyze fitness landscapes are not sufficient to explain why or when a problem is difficult to be solved or not. This paper focuses on sequencing problems in order to shed light on the shortcoming of some widely used statistical measures in landscape analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literaturverzeichnis
Adams, J.; Balas, E.; Zawack, D: The Shifting Bottleneck Procedure for Job Shop Scheduling. In: Management Science 34 (1988) 391–401
Bierwirth, C.; Mattfeld, D.C.; Watson J.-P.: Landscape Regularity and Random Walks for the Job Shop Scheduling Problem. In: Gottlieb, J.; Raidl, G.R. (Hrsg.): Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science (2004) 21–30
Jones, T: One Operator, One Landscape. Santa Fe Institute, Working Paper No 95-02-025, 1995
Jones, T; Forrest, S.: Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In: Proceedings of the 6th Int. Conference on Genetic Algorithms. Morgan Kaufmann Publishers, 1995, 184–192
Kauffmann, S.A.: The Origins of Order. Oxford University Press, 1993
Kirkpatrick, S.; Toulouse, G.: Configuration Space Analysis for Travelling Salesman Problems. In: J. de Physique 46 (1985) 1277–1292
Mattfeld, D.C.; Bierwirth, C.; Kopfer, H.: A Search Space Analysis of the Job Shop Scheduling Problem. In: Annals of Operations Research 86 (1999) 441–453
Merz, P.; Freisleben, B.: Fitness Landscapes, Memetic and Algorithms for the Quadratic Assignment Problem. In: IEEE Transactions on Evolutionary Computation 4 (2000) 337–352
Merz, P.; Freisleben, B.: Fitness Landscapes, Memetic Algorithms and Greedy Operators for Graph Bi-Partitioning. In: Evolutionary Computation 8 (2000) 61–91
Merz, P.: Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms. In: Evolutionary Computation 12 (2004) 303–325
Nowicki, E.; Smutnicki, C.: Some new Ideas in Tabu Search for Job Shop Scheduling. In: Rego, C.; Alidaee, B. (Hrsg.): Metaheuristic Optimization via Memory and Evolution — Tabu Search and Scatter Search. Kluwer Academic Publishers, Boston 2005, 165–190
Stadler, P.F.; Schnabl, W.; The landscape of the Traveling Salesman Problem. In: Physics Letters A 161 (1992) 337–344
Stadler, P.F.; Happel, R.: Correlation Structure of the Landscape of the Graph Bi-Partitioning Problem. In: J. Pfysics A 25 (1992) 3103–3110
Stadler, P.: Fitness Landscapes. In: Lässig, M.; Vallerian, A. (Hrsg.): Biological Evolution and Statistical Physics. Springer, Berlin 2002, 187–202
Taillard, È. D.: Comparison of Iterative Searches for the Quadratic Assignment Problem. In: Location Science 3 (1990) 65–74
Weinberger, E: Correlated and Uncorrelated Fitness Landscapes and how to tell the Difference. Biol. Cybernetics 63 (1990) 325–336
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Betriebswirtschaftlicher Verlag Dr. Th. Gabler | GWV Fachverlage GmbH, Wiesbaden
About this chapter
Cite this chapter
Bierwirth, C. (2008). Das Konzept der Fitnesslandschaft als Methode zur Beurteilung der Schwierigkeit von kombinatorischen Optimierungsproblemen. In: Bortfeldt, A., Homberger, J., Kopfer, H., Pankratz, G., Strangmeier, R. (eds) Intelligent Decision Support. Gabler. https://doi.org/10.1007/978-3-8349-9777-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-8349-9777-7_17
Publisher Name: Gabler
Print ISBN: 978-3-8349-0930-5
Online ISBN: 978-3-8349-9777-7
eBook Packages: Business and EconomicsBusiness and Management (R0)