Abstract
In this paper the Max-RWA problem was mathematically formulated and solved approximately by three efficient random search algorithms namely Random Optimization Algorithm (ROA), Genetic Algorithm (GA) and Tabu Search Algorithm (TSA). The routing subproblem was insured exactly by the backtracking algorithm. TSA achieves up to a 23% improvement over GA and a 10% improvement over ROA.
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.
