Abstract
This abstract summarizes the results reported in the paper [4]. In this paper a new method of performing the local search for the multiobjective Firefighter Problem (FFP) is proposed. The proposed method reduces the size of the neighbourhood in which the local search looks for improved solutions by using heuristics to decide which solutions in the neighbourhood should be visited. In the paper the proposed local search method is used for improving solutions produced by two commonly used evolutionary algorithms: the MOEA/D and the NSGA-II. In the experiments the proposed method outperformed both the evolutionary algorithms without any local search (the 'None' method) as well as the algorithms combined with the local search visiting all solutions in the neighbourhood (the 'Full' method). Comparison to the local search selecting the same number of solutions as the ED-LS, but at random (the 'Random' method) shows that the proposed heuristics are indeed selecting good solutions to visit. Presented research can be extended in further studies. One possibility is to study in-depth how to balance computational resources between the evolutionary and local search algorithms. Second possibility is to employ more advanced models instead of the heuristics used in the paper.
Sign-in/Register to access full text options 
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.
