I have three type of facilities: Plants, DCs and Reatails(See attached image). I want to select the most optimal routes to serve the retails.
The set of feasible routes, T = {t111,t113,t125,t212,t224,t227,t236,t313,t325,t326,t337,t338,t339}
How can I define the set of routes for the problem? The routes need to support the links rather than mere names.
I have seen a implementation of shortest path algorithms.
Parameter uarc(i,ip) ‘undirected arcs’
/ boston .chicago 58, boston .wash-dc 25 /;
Can three nodes be implemented same way? If so how?
