There are "hierarchical" schemes which attempt to clump graphs together. SBCL has a special case of trying to lay down lists sequentially.

Anything with a read barrier might also be able to see which slots are hotter, and thus prioritise copying those first; there was one paper from the 90s showing profiling helped get a better layout.