Abstract
The min-max regret Shortest Path Tree problem (RSPT) is a NP-Hard Robust Optimization counterpart of the Shortest Path Tree problem, where arcs costs are modeled as intervals of possible values. This problem arises from the uncertainty in link quality the routing protocols for IPv6 Low Wireless Personal Area Networks have to handle. In this paper, we propose a Variable Neighborhood Descent (VND) heuristic based on a Mixed Integer Linear Programming formulation. An exact algorithm based on the same formulation is used to assess the quality of this heuristic. Computational experiments show that VND has an average optimality gap of 0.91%, being smaller that with the best heuristic in literature for RSPT.
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.
