© 2019 IEEE. Routing in delay tolerant network (DTN) is one of the most challenging problems in addressing the application specific requirements. This paper presents a routing algorithm in DTN that achieves the delivery ratio within the given deadline requirements by evaluating the capability of a node to deliver a message to its destination on the basis of destination-dependent and destination-independent attributes of the encountered node. The protocol dynamically adjusts the number of message copies based on our previous works [13] and chooses the most suitable relay node by taking the delivery probability to the destination and the remaining energy level of nodes into account. Simulation results demonstrate that our proposed algorithm achieves better performance compared to the counterpart and is adaptive to varying network conditions.