A　proper　edge　coloring　of　a　graph　G　is　acyclic　if　there　is　no　bichromatic　cycle　in　G.　The　acyclic　chromatic　index　of　G,　denoted　chi(a)＇(G),　is　the　least　number　of　colors　k　such　that　G　has　an　acyclic　k-edge-coloring.　In　this　paper,　it　is　shown　that　if　G　is　a　planar　graph　with　girth　at　least　5　and　maximum　degree　Delta,　then　chi(a)＇(G)　＜=　Delta　+　1.　Moreover,　Delta　＞=　9,　then　chi(a)＇(G)　=　Delta.　(C)　2013　Elsevier　B.V.　All　rights　reserved.