with a pair of pickup and delivery nodes. Eventually, the original routing problem defined on the G is converted into a routing problem defined on the GE that seeks to find the shortest Hamiltonian path from s to t satisfying the request of every (demand) node and the vehicle capacity constraints throughout the path