Dual-path allocation problem is considered to be a case of multipath routing in Elastic Optical Networks. In this article, the optimization problem is formulated and a dual-path allocation algorithm that solves this problem proposed. In the considered problem all traffic for each request is broken into two equal parts, which are directed along two link-disjoint paths. After any link failure, half of the traffic for each affected request is realized. The proposed algorithm is based on the two weight matrices: the elements of the first one depend on the actual length of the links and their utilization, while the elements of the second one assume unit values if the links exist in the network. The proposed algorithm rejects smaller requests and provides a much lower bandwidth blocking probability than other analyzed algorithms.