Abstract
AbstractIn this paper, we investigate a multicast routing problem with quality of service constraints on ad hoc vehicular networks. An integer programming formulation for the problem is proposed that forms the basis of a relax‐and‐fix heuristic designed with the goal of producing feasible solutions of good quality. In addition, preprocessing procedures relying on simple and constrained shortest paths are developed that reduce the model size to the point of making it viable to compute. Computational experiments on benchmark instances generated to mimic realistic settings are reported. The results highlight the effectiveness of the relax‐and‐fix heuristic and the importance of the preprocessing routines for the computability of the proposed mathematical model.
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 callMore From: International Transactions in Operational Research
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.
