Abstract
The Minimum Back-Walk-Free Latency Problem (MBLP) is an extension of the Minimum Latency Problem (MLP). It aims to find a tour with minimum latency while ignoring the back-walking costs. One of the justifications for ignoring the back-walking costs is in applications of message broadcasting for mobile devices. Obviously, the MBLP is NP-hard problem because it is a particular variant of MLP. Therefore, metaheuristic needs to be developed to provide near-optimal solutions within a short computation time. However, the main issue of metaheuristics is that they fall into local optima in some cases since the search space of the problem is combinatorial explosion. To overcome the drawback, we propose a metaheuristic algorithm combined between the Variable Neighbourhood Search (VNS) and shaking technique to solve the problem. The aim of VNS is to generate diverse neighbourhoods by using various neighbourhood searches while the shaking technique guides the search towards an unexplored part of the solution space. Moreover, a technique called Adaptive Memory (AM) is applied to balance between diversity and intensification. The computational results show that the effectiveness and efficiency of the proposed algorithm are comparable with the state-of-the-art algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computer Applications in Technology
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.