Analyzing the role of "smart" start points in coarse search-greedy search

Authors:
Stephen Chen;Ken Miura;Sarah Razzaqi
Affiliations:
School of Information Technology, York University, Toronto, Ontario;Institute for Aerospace Studies, University of Toronto, Toronto, Ontario;Centre for Hypersonics, Division of Mechanical Engineering, University of Queensland, Brisbane, Australia
Venue:
ACAL'07 Proceedings of the 3rd Australian conference on Progress in artificial life
Year:
2007

Citing 4
Cited 4

Models for iterative global optimization

Models for iterative global optimization
Evolution strategies –A comprehensive introduction

Natural Computing: an international journal
Formal Memetic Algorithms

Selected Papers from AISB Workshop on Evolutionary Computing
Towards the automated design of phased array ultrasonic transducers: using particle swarms to find "Smart" start points

IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems

Locust swarms: a new multi-optima search technique

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An Analysis of Locust Swarms on Large Scale Global Optimization Problems

ACAL '09 Proceedings of the 4th Australian Conference on Artificial Life: Borrowing from Biology
Optimization in Fractal and Fractured Landscapes Using Locust Swarms

ACAL '09 Proceedings of the 4th Australian Conference on Artificial Life: Borrowing from Biology
Selection strategies for initial positions and initial velocities in multi-optima particle swarms

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

An inherent assumption in many search techniques is that information from existing solution(s) can help guide the search process to find better solutions. For example, memetic algorithms can use information from existing local optima to effectively explore a globally convex search space, and genetic algorithms assemble new solution candidates from existing solution components. At the extreme, the quality of a random solution may even be used to identify promising areas of the search space to explore. The best of several random solutions can be viewed as a "smart" start point for a greedy search technique, and the benefits of "smart" start points are demonstrated on several benchmark and real-world optimization problems. Although limitations exist, "smart" start points are most likely to be useful on continuous domain problems that have expensive solution evaluations.