2

I am working on a pipeline inspection project and there is a high liklihood that some inspection tool deployment/retrieval station will need to be installed on the pipe network. the problem is determining the best places to locate the stations. Analytically it would seem that I am looking for a minimum set of loactions P such that the network distance l between any two points "adjacent" pi, pj to eachother on the network is less than or equal to a given distance L

P = min{ p(x,y) | l(pi,pj) <= L }

I am at a loss as to where to start in solving this problem.

closed as too broad by ahmadhanb, aldo_tapia, mgri, whyzar, lynxlynxlynx Nov 7 '17 at 16:33

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • 2
    This is probably a bit too broad for one question, and should be broken down into parts. Additionally, the locations will likely be driven more by feasibility and system layout rather than just the distance between launcher/receiver. I'd start with identifying the groups of the pipelines that will be inspected (systems), then research the areas that it would actually be possible to install a station at. At that point you may want to continue to do an analysis to determine which sites to use. – Evil Genius Jun 24 '14 at 16:44
  • I understand that the network connectivity should be its own question so I removed it from this one. What other ways would you break up this problem? – DLY Jun 24 '14 at 17:40
  • 1
    I have already narrowed down my system to what will be inspected and am addressing feasability to weight perfered locations but I am also looking for a general solution to be applied to any geometric network. I think this sort of question woukld be of great use for many people – DLY Jun 24 '14 at 17:45