یادگیری متلمارکایی در بهینه سازی چند منظوره برای جستجوی شبکه های اجتماعی تلفن همراه

The proposed Meta-Lamarckian based MOEA does not utilize any problem-specific heuristics, as most cases in the literature do, facilitating its applicability to other combinatorial MOO problems. To test its generalizability the proposed method is also evaluated on various test instances of the well-studied multi-objective Permutation Flow Shop Scheduling Problem.