An $m\times (k+r)$ binary maximum distance separable (MDS) array code contains $k$ information columns and $r$ parity columns with each entry being a bit, where any $k$ out of $k+r$ columns can recover the $k$ information columns. When there is a failed column, it is critical to minimize the repair bandwidth that is the total number of bits downloaded from $d$ out of $k+r-1$ surviving columns in repairing the failed column. In this article, we first propose two explicit constructions of binary MDS array codes that have asymptotically optimal repair bandwidth for any information column, where $r\geq 2$ and $d=k+r-1$ for the first construction, and $r\geq 4$ is an even number and $d=k+\frac {r}{2}-1$ for the second construction. By applying a generic transformation for the proposed two classes of binary MDS array codes, we then obtain two classes of new binary MDS array codes that also have optimal repair bandwidth for any parity column and asymptotically optimal repair bandwidth for any information column.