The economy of every nation is centred on its transportation networks, which are also transforming the global economy. To reduce trip times and fuel costs, use graph decomposition techniques to optimize transportation networks. A 2− acyclic simple graphoidal cover of G is a set of paths in G such that every edge is in exactly one path in and every vertex is an internal vertex of at most two paths in and any two paths in has at most one vertex in common. The minimum cardinality of the 2−acyclic simple graphoidal cover of G is called the 2−acyclic simple graphoidal covering number of G and is denoted by . In this study, we discuss decomposition of complete bipartite graphs using 2-acyclic simple graphoidal covers.