This material contains an executable program for solving classic Tammes problem and the best solutions found for instances in the range of N<=200. The corresponding algorithm is described in the following paper:
Xiangjing Lai, Dong Yue, Jin-Kao Hao, Fred Glover, Zhipeng Lv, Iterated dynamic neighborhood search for packing equal circles on a sphere, Computers & Operations Research, 151: 106121, 2023.
In addition, we provide the graphical representations of the best solutions for two representative instances (N =149 and 150).
Packing configuration for N=149:
Packing configuration for N=150:
Voronoi representation for N=149:
Voronoi representation for N=150:
