Abstract
A fast diagonal completion algorithm is developed for constructing a good initial feasible solution for travelling salesman problems. The algorithm can be combined with any tour improvement approach but is specifically considered here in conjunction with the 2-optimal method which is shown to give good results without excessive demands on computer time. Computational experience with a variety of problems from small to large size is reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have