摘要: This chapter reports the results of Multimeme algorithms that employ adaptive helpers. A Algorithm resorts to a variety local search neighborhoods for its stage allowing more robust global search. Each neighborhood is explored by an helper allows non-improving moves render Memetic algorithm even deceptive optima. We will report on use single Traveling Salesman Problem (TSP) and helpers within TSP Protein Structure Prediction (PSP).