Home // ICSEA 2019, The Fourteenth International Conference on Software Engineering Advances // View article

The Matching Lego(R)-Like Bricks Problem: Including a Use Case Study in the Manufacturing Industry

Authors:
Martin Zinner
Kim Feldhoff
Rui Song
André Gellrich
Wolfgang E. Nagel

Keywords: Constraint satisfaction problem; Combinatorial problem; Genetic algorithm; Crossover; Mutation.

Abstract:
We formulate and transform a real-world combinatorial problem into a constraint satisfaction problem: choose a restricted set of containers from a warehouse, such that the elements contained in the containers satisfy some restrictions and compatibility criteria. We set up a formal, mathematical model, describe the combinatorial problem and define a (nonlinear) system of equations, which describes the equivalent constraint satisfaction problem. Next, we use the framework provided by the Apache Commons Mathematics Library in order to implement a solution based on genetic algorithms. We carry out performance tests and show that a general approach, having business logic solely in the definition of the fitness function, can deliver satisfactory results for a real-world use-case in the manufacturing industry.

Pages: 130 to 140

Copyright: Copyright (c) IARIA, 2019

Publication date: November 24, 2019

Published in: conference

ISSN: 2308-4235

ISBN: 978-1-61208-752-8

Location: Valencia, Spain

Dates: from November 24, 2019 to November 28, 2019