The hybrid big bang–big crunch algorithm is a combination of a global optimization algorithm inspired by one of the theories of the evolution of the universe, named the big bang and big crunch theory, and the simulated annealing method. The procedure was implemented in the latest version of the programEXPOand applied to crystal-structure solution from powder diffraction data. Several aspects of the hybrid big bang–big crunch algorithm can be further optimized with the aim of obtaining good quality solutions in a shorter computation time. In the present study, the hybrid big bang–big crunch procedure has been combined with the greedy randomized adaptive search procedure (GRASP) and some steps of the algorithm have been improved. The new approach, implemented in theEXPOpackage, has been successfully tested on numerous known crystal structures.