An edge colouring $c$ of a graph $G$ is called conflic-free if every non-isolated edge of $G$ has a uniquely coloured neighbour in its open edge neighbourhood. The least number of colours admitting such a colouring is denoted by $χ'_{\rm OCF}(G)$, or $χ'_{\rm pOCF}(G)$ if we additionally require $c$ to be proper. Our main result implies in particular that $χ'_{\rm OCF}(G) \le \log_2 Δ+ O(\ln\lnΔ)$ for nearly regular graphs $G$ with maximum degree $Δ$, which is asymptotically optimal, as witnessed by the complete graphs. For proper colourings, we moreover show that $χ'_{\rm pOCF}(G) \le Δ+ O(\ln Δ)$ in the same regime. These results improve existing bounds stemming from related colouring models and transfer directly to random graphs' setting. The proofs combine decomposition techniques with probabilistic arguments and structural properties of edge neighbourhoods.