Space defragmentation for packing problems

► Represented a packing layout by a set of comparability graphs. ► Devised two operators to collate fragmented space to improve packing density. ► Proposed a line sweeping algorithm to find maximum usable space. ► Proposed a monotonic improvement operator based on bin shuffling. ► Beat all existing approaches on standard benchmark data and new instances.