Evolutionary approaches to the three-dimensional multi-pipe routing problem: a comparative study using direct encodings

  • Authors:
  • Marcus Furuholmen;Kyrre Glette;Mats Hovin;Jim Torresen

  • Affiliations:
  • Aker Solutions AS, Fornebu, Norway;Department of Informatics, University of Oslo, Blindern, Oslo, Norway;Department of Informatics, University of Oslo, Blindern, Oslo, Norway;Department of Informatics, University of Oslo, Blindern, Oslo, Norway

  • Venue:
  • EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this study, three Genetic Algorithms (GAs) are applied to the Three-dimensional Multi-pipe Routing problem. A Standard GA, an Incremental GA, and a Coevolutionary GA are compared. Variable length pipelines are built by letting a virtual robot move in space according to evolved, fixed length command lines and allocate pipe segments along its route. A relative and an absolute encoding of the command lines are compared. Experiments on three proposed benchmark problems show that the GAs taking advantage of the natural problem decomposition; Coevolutionary GA, and Incremental GA outperform Standard GA, and that the relative encoding works better than the absolute encoding. The methods, the results, and the relevant parameter settings are discussed.