The best upper bounds obtained as well as the methods developed to obtain them are described in:
Bernardino, R., & Paias, A. (2020). Heuristic approaches for the family traveling salesman problem. International Transactions in Operational Research.
A summary of the best known upper bounds may be downloaded in the following link: