A Hybrid Optimization Method Based on Chaotic Search and Pattern Search

2008 
Chaotic search can effectively jump out of local minima but it has poor fine search ability.Pattern search method has excellent local search ability;however its search result mostly depends on the initial point.To enhance the precision of optimization results,a hybrid chaotic pattern search method(HCPSM) is presented in this paper based on the chaotic search and pattern search method.The final(result) is found by pattern search based on the result of chaotic search.The result of chaotic search is not(required) to be high precise,but it can provide an effective initial point for pattern search method to avoid the local minima.The ideal optimum can be found by simple pattern search based on good initial point.Simulation results show that the HCPSM is simple and high effective.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    2
    Citations
    NaN
    KQI
    []