EVOLUTION PROGRAM FOR DESIGN OF RECTILINEAR BRANCHED NETWORKS

The authors present a new algorithm for designing the layout of rectilinear branched pipeline networks. A binary solution-coding scheme, similar to the type commonly used in genetic algorithms, is employed; however, two new operators, recombination and perturbation replace the genetic algorithm operators of crossover and mutation. An architecture based on evolution strategy is used to exploit the unique characteristics of the new operators. The technique is illustrated on a small problem and compared with a method based on heuristics. Through demonstration and comparison, investigators conclude that the evolution program is capable of generating better solutions than the heuristic method.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/08873801
• Corporate Authors:

  American Society of Civil Engineers

  345 East 47th Street
  New York, NY  United States  10017-2398
• Authors:
  • Davidson, J W
  • Goulter, I C
• Publication Date: 1995-4

Language

• English

Media Info

• Features: Appendices; Figures; References; Tables;
• Pagination: p. 112-121
• Serial:
  • Journal of Computing in Civil Engineering
  • Volume: 9
  • Issue Number: 2
  • Publisher: American Society of Civil Engineers
  • ISSN: 0887-3801

Subject/Index Terms

• TRT Terms: Algorithms; Alternatives analysis; Diagrams; Evolution; Genetics; Networks; Physical distribution; Pipelines; Structural design
• Uncontrolled Terms: Distribution systems
• Old TRIS Terms: Pipeline design; Schematic diagrams
• Subject Areas: Design; Environment; Freight Transportation; Pipelines; Terminals and Facilities;

Filing Info

• Accession Number: 00680642
• Record Type: Publication
• Files: TRIS
• Created Date: Jun 26 1995 12:00AM