An Indirect Approach to the Three-Dimensional Multi-pipe Routing Problem

2010 ◽  
pp. 86-97
Author(s):  
Marcus Furuholmen ◽  
Kyrre Glette ◽  
Mats Hovin ◽  
Jim Torresen
Keyword(s):  
Three Dimensional ◽  
Routing Problem ◽  
Indirect Approach ◽  
Pipe Routing

GAPRUS: Three-Dimensional Pipe Routing Using Genetic Algorithms and Tessellated Objects

1997 ◽  
Author(s):  
Sunand Sandurkar ◽  
Wei Chen ◽  
Georges M. Fadel
Keyword(s):  
Genetic Algorithms ◽  
Computational Efficiency ◽  
Three Dimensional ◽  
Past Research ◽  
Optimization Techniques ◽  
Optimization Approach ◽  
Routing Problem ◽  
Deterministic Optimization ◽  
Highly Nonlinear ◽  
Pipe Routing

Abstract Pipe routing is the technique of developing collision-free routes for pipes between two locations in an environment scattered with obstacles. In the past, research has been primarily focused on the use of deterministic optimization techniques to derive the optimal route. Computational efficiency of deterministic techniques is low for highly nonlinear and sometimes discontinuous problems like the pipe routing problem. Besides, due to limitations in the representation of 3-dimensional geometry, the shapes of obstacles have been restricted to primitives. In this paper we present a novel approach to overcome these limitations. A non-deterministic optimization approach based on Genetic Algorithms is proposed to generate pipe routing solution sets with a high computational efficiency. Representation of the objects and pipes in the tessellated format offers huge benefits in computation as well as adaptability. We demonstrate the versatility of our approach and its ability to accommodate and solve problems involving 3-D freeform obstacles.

A Knowledge Based Automatic Pipe Routing System

1992 ◽  
Author(s):  
D. Jain ◽  
M. Chatterjee ◽  
A. Unemori ◽  
N. Thangam
Keyword(s):  
Dimensional Space ◽  
Compact Representation ◽  
Routing Problem ◽  
3 Dimensional ◽  
Intelligent Search ◽  
Knowledge Based ◽  
Embedded Design ◽  
Pipe Routing ◽  
Different Types ◽  
Significant Attention

Abstract The pipe routing problem, wherein layout of one or more pipes has to be decided in a 3-dimensional space while satisfying several different types of constraints, has attracted significant attention recently. This paper describes a knowledge-based automated pipe routing system which generates practical routes that meet several diverse criteria. The system employs intelligent search (with embedded design constraints) upon a compact representation of the free space in a facility, thus avoiding expensive interference checks and adjustments that must be performed in some of the other systems.

TIME LOWER BOUNDS FOR PERMUTATION ROUTING ON MULTI-DIMENSIONAL BUSED MESHES

1993 ◽  
Vol 03 (02) ◽  
pp. 129-138
Author(s):  
STEVEN CHEUNG ◽  
FRANCIS C.M. LAU
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Three Dimensional ◽  
Dimensional Case ◽  
Routing Problem ◽  
Higher Dimensional ◽  
Low Dimensional ◽  
Permutation Routing

We present time lower bounds for the permutation routing problem on three- and higher-dimensional n x…x n meshes with buses. We prove an (r–1)n/r lower bound for the general case of an r-dimensional bused mesh, r≥2, which is not as strong for low-dimensional as for higher-dimensional cases. We then use a different approach to construct a 0.705n lower bound for the three-dimensional case.

Sign in / Sign up

Export Citation Format

Share Document