Abstract
Performance of 2-opt and 3-opt local search procedures for the weight constrained symmetric traveling salesman problem (WCTSP) on a complete graph have been estimated. For TSPLIB problems for which optimal solutions are available, 2-opt and 3-opt gave solutions within 10%. Lagrangian relaxation of the 1-tree approximation scheme for TSP has been adopted for WCTSP to obtain lower bounds. For the TSPLIB problems for which optimal solutions are not available local search outputs were compared with the lower bounds and the error percentage was below 17%.
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.
