The　cyclic　cutwidth　minimization　problem　(CCMP)　is　a　graph　layout　problem　that　involves　embedding　a　graph　onto　a　circle　to　minimize　the　maximum　cutwidth　of　the　graph.　In　this　paper,　we　present　breakout　local　search　(BLS)　for　solving　CCMP,　which　combines　a　dedicated　local　search　procedure　to　discover　high-quality　local　optimal　solutions　and　an　adaptive　diversification　strategy　to　escape　from　local　optima.　Extensive　computational　results　on　a　wide　set　of　179　publicly　available　benchmark　instances　show　that　the　proposed　BLS　algorithm　has　excellent　performance　with　respect　to　the　best-performing　state-of-the-art　approaches　in　terms　of　solution　quality　and　computational　time.　In　particular,　it　reports　improved　best-known　solutions　for　31　instances,　while　finding　matching　best-known　results　on　139　instances.