Scatter search

摘要: The evolutionary approach called scatter search originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages of this solving a diverse array optimisation problems both classical real--world settings. Scatter contrasts with other procedures, such as genetic algorithms, by providing unifying principles joining solutions based on generalised path constructions in Euclidean space utilising strategic designs where approaches resort to randomisation. Additional are provided intensification diversification mechanisms that exploit adaptive memory, drawing foundations link tabu search. main goal chapter is development procedure demonstrating how it may be applied class non-linear bounded variables. We conclude highlighting key ideas research issues offer promise yielding future advances.