Under high complexity - given by pervasive interdependence between constituent elements of a decision in an NK landscape - our algorithm obtains fitness superior to that reported in extant research. We distribute the decision elements comprising a decision into clusters. When a change in value of a decision element is considered, a forward move is made if the aggregate fitness of the cluster members residing alongside the decision element is higher. The decision configuration with the highest fitness in the path is selected. Increasing the number of clusters obtains even higher fitness. Further, implementing moves comprising of up to two changes in a cluster also obtains higher fitness. Our algorithm obtains superior outcomes by enabling more extensive search, allowing inspection of more distant configurations. We name this algorithm the muddling through algorithm, in memory of Charles Lindblom who spotted the efficacy of the process long before sophisticated computer simulations came into being.
[1]
Daniel A. Levinthal.
Adaptation on rugged landscapes
,
1997
.
[2]
Stuart A. Kauffman,et al.
The origins of order
,
1993
.
[3]
Interaction Between Evolution and Learning in NK Fitness Landscapes
,
2020
.
[4]
Yehezkel Dror,et al.
Muddling Through-"Science" or Inertia?
,
1964
.
[5]
C. Lindblom.
Still Muddling, Not Yet Through.
,
1979
.
[6]
Athanassios Siapas,et al.
Criticality and Parallelism in Combinatorial Optimization
,
1996,
Science.
[7]
Oliver Baumann,et al.
Dealing with Complexity: Integrated vs. Chunky Search Processes
,
2011,
Organ. Sci..
[8]
C. Lindblom.
THE SCIENCE OF MUDDLING THROUGH
,
1959
.