Optimal Pipe Routing Techniques in an Obstacle-Free 3D Space
Résumé
This paper introduces two approaches to automate the design of pipe-systems in a continuous 3D space to assist designers to deal with the high number of constraints of the pipe routing problem. This work assimilates a pipe to a succession of straight sections and bends in which possible bends are restricted to a bend catalog containing orthogonal and non orthogonal bends. As a preliminary work, both methods ignore obstacles but take into account pipe section orientations to deal with asymmetrical pipe sections. To do so, a graph of reachable pipe orientations is generated from the bend catalog. Then, the first approach enumerates valid bend combinations using the previous graph and computes the optimal length of straight sections for each combination using a Linear Program. The second one formulates the pipe routing problem as a Mixed Integer Linear Programming problem based on enumerated reachable orientations. Both approaches are tested on realistic scenarios inspired by industrial problems.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...