Dandelion optimizer algorithm (DO) is a meta-heuristic algorithm that draws inspiration from the life journey of dandelion seeds. However, the traditional DO requires a lot memory to store the large number of particles and some important parameters. In order to solve the issue of memory space, the compact method is applied to DO in this paper. To further enhance the search ability of dandelions, the parallel compact dandelion optimizer algorithm (PCDO) based on compact and parallel strategies is proposed. The PCDO is examined on the CEC2013 functions. The PCDO is compared with some conventional algorithms. The statistical results demonstrate that PCDO shows improved optimization performance.