Iterated dynamic thresholding search for packing equal circles into a circular container

•Packing N equal circles in a circular container is a relevant model for many applications.•We present a heuristic algorithm for this challenging problem.•We show computational results for N=320 including 136 improved best results (new upper bounds).•The implemented algorithmic ideas can help to design algorithms for other parking-related optimization problems.