An optimal design of piping route in a CAD system for power plant

Computers and Mathematics with Applications

Volumn 35, Issue 6, 1998, Pages 137-149

  Yamada, Y ^a   Teraoka, Y ^b  

^a MITSUBISHI HEAVY INDUSTRIES LTD   (Japan)

^b Osaka Prefecture University   (Japan)

Author keywords

Graph representation; Piping layout; Shortest path problem; Space model

Indexed keywords

COMPUTER AIDED DESIGN; GRAPH THEORY; MATHEMATICAL MODELS; NUCLEAR POWER PLANTS; OPTIMAL SYSTEMS; OPTIMIZATION; PIPELINES; PROBLEM SOLVING;

COMPUTER AIDED DESIGN SYSTEM; GRAPH REPRESENTATION; PIPING LAYOUT; SHORTEST PATH PROBLEM;

PIPING SYSTEMS;

EID: 0032019431     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(98)00025-X     Document Type: Article

References (8)

1. M. Iri and T. Koshizuka, Computational Geometry and Geographic Information (in Japanese), Kyouritsu Shuppan, (1993).
2. T. Asano, Computational Geometry (in Japanese), Asakura Shoten, (1993).
3. S. Kund, An O(n) algorithm for determining the subregion-tree representation of a rectangular dissection, SIAM J. Comp. 22 (1), 79-101 (1993).
4. G.E. Wangdahl, S.M. Pollock and J.B. Woodward, Minimum trajectory pipe routing, Journal of Ship Research 18 (1), 46-49 (1974).
5. T. Yoshinaga, T. Kiguchi, S. Tokumatu and K. Kumamoto, Three dimensional computer aided design system for plant layout (in Japanese), Hitachi Hyouron 68 (4), 59-64 (1993).
6. E.W. Dijkstra, A note on two problems in connexion with graph, Numerische Mathematik 1, 269-271 (1959).
7. B. Carre, Graphs and Networks, Clarendon Press, Oxford, (1979).
8. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, (1974).