Effective multi-objective discrete optimization of Truss-Z layouts using a GPU

2018 
Abstract Truss-Z (TZ) is an Extremely Modular System for creating skeletal free-form ramps and ramp networks. The TZ structures are comprised of four variations of two types of basic unit subjected to rotation. The two types of units are: R and L being a mirror reflection of each other. This paper presents a novel method based on image processing, evolutionary algorithm and intensive parallelization of multi-objective optimization of TZ layouts. The algorithm returns a sequence of modules. The result guarantees a TZ connection between two given points (regions) and minimizes the fitness function representing certain costs associated with setting up the TZ structure. The fitness function depends on the cost of TZ structure as well as the variety of costs related to the environment where the it is to be placed. E.g.: the earthworks, vegetation removal, obstacles avoidance, etc. There are no restrictions on the fitness function definition. It can depend on any variable which can be represented by a two-dimensional map of any property of the environment. The formulation of the presented method is suited for application of well-established image processing methods which efficiently evaluate candidate solutions on a GPU. As a result, the employed genetic algorithm efficiently probes the search space. The practical applicability of this approach is demonstrated with three case-studies: 1 simultaneous paving of a path with congruent units in a hilly environment with trees & bushes and finding the best location for a pier over an existing river; 2 constructing of a TZ connector spanning over a mountain valley with lakes (where supports can not be placed); 3 retrofitting of an existing railway station with a large wheelchair TZ ramp of over 10 m elevation while preserving trees and minimizing the earthworks.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    19
    References
    10
    Citations
    NaN
    KQI
    []