This paper investigates GA approaches for solving the reliable communication network design problem. For solving this problem a network with minimum cost must be found that satisfies a given network reliability constraint. To consider the additional reliability constraint different approaches are possible. We show that existing approaches using penalty functions can result in invalid solutions and are therefore not appropriate for solving this problem. To overcome these problems we present a repair heuristic, which is based on the number of spanning trees in a network. This heuristic always generates a valid solution, which when compared to a greedy cheapest repair heuristic shows that the new approach finds better solutions with less computational effort.

No abstract

The semiconductor industry is strongly increasing the production capacities and the product portfolio for a wide range of applications that are needed in the worldwide supply chains e.g. the automotive, computer and security industry. The complex manufacturing processes require more automation, dig- italisation and IoT frameworks, especially for highly automated semiconductor manufacturing plants. Over the last years, this industry spent much effort to control highly sensitive materials in production by product monitoring using advanced process control by various sensors in production. Nevertheless, until today, sensor integration, especially for such sensors that are not supported by the equipment vendors, is time-consuming and complicated. This article aims to use a micro-service-based approach by Eclipse Arrowhead as an open-source microservice architecture and implementation platform [1]. This architecture is an easy and powerful framework that can be used for multiple sensor applications to control the manufacturing material flow in a modern semiconductor plant with a high product mix. The article describes how the engineering process was designed, the architecture of the use case and the main benefits in the operational business are shown.

For the reliable communication network design (RCND) problem links are unreliable and for each link several options are available with different reliabilities and costs. The goal is to find a cost-minimal communication network design that satisfies a pre-defined overall reliability constraint. This paper presents two new EA approaches, LaBORNet and BaBORNet, for the RCND problem. LaBORNet uses an encoding that represents the network topology as well as the used link options and repairs infeasible solutions using an additional repair heuristic (CURE). BaBORNet encodes only the network topology and determines the link options by using the repair heuristic CURE as a local search method. The experimental results show that the new EA approaches using repair heuristics outperform existing EA approaches from the literature using penalties for infeasible solutions and find better solutions for existing problems from the literature as well as for new and larger test problems.

No abstract