Abstract
Mobile Social Networks (MSNs) have recently brought a revolution in socially-oriented applications and services for mobile phones. In this paper, we consider the search problem in a MSN that aims at simultaneously maximizing the user's search outcome (recall) and mobile phone performance (battery usage). Because of the conflicting nature of these two objectives, the problem is dealt within the context of Multi-Objective Optimization (MOO). Our proposed approach hybridizes a Multi-objective Evolutionary Algorithm based on Decomposition (MOEA/D) with a Meta-Lamarckian (ML) learning strategy that learns from the problem's properties and objective functions. The ML strategy is devised for adaptively select the best performing local search heuristic for each case, from a pool of general-purpose heuristics, so as to locally optimize the solutions during the evolution. We evaluated our propositions on a realistic multi-objective MSN search problem using trace-driven experiments with real mobility and social patterns. Extensive experimental studies reveal that the proposed method successfully learns the behaviour of individual local search heuristics during the evolution, adaptively follows the pattern of the best performing heuristics at different areas of the objective space and offers better performance in terms of both convergence and diversity than its competitors.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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.