Abstract
Multi-objective Ant Colony Optimization (MOACO) is a popular algorithm in solving the multi-objective combinational optimization problem. Many variants were introduced to solve different types of multi-objective optimization problem. However, MOACO does not guarantee to generate a good approximation of solution in a predefined termination time. In this paper, Two-Phase Local Search (TPLS) was introduced to cooperate with the MOACO, a two-phase strategy that creates a very good approximation of Pareto Front at the beginning of the algorithm and then further explores the Pareto Front iteratively. We also propose Iterated Local Search – Variable Neighborhood Search (ILS-VNS) as the first phase in TPLS, an iterative improvement process that allows finding improving solutions from adaptively sized neighborhood space. A series of experiments were performed to investigate the performance improvement on the solutions. At the same time, we studied the effect of Weighted Local Search (WLS) and Pareto Local Search (PLS) in the proposed algorithm. The results showed that the newly proposed algorithm obtains a larger area on hypervolume space and exhibits a significantly larger accuracy rate in obtaining the true Pareto-optimal solutions. Additionally, a statistical testing was also performed to verify the significance of the result.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
