Optimisation of the concurrent product and process configuration: an approach to reduce computation time with an experimental evaluation

Concurrent configuration of a product and its associated production process is a challenging problem in customer/supplier relations dealing with customisable or configurable products. It gathers in a single model multiple choices and constraints which come simultaneously from products (choices of components or functionalities), from processes (choices of resources and quantities) and from their mutual interrelations. Considering this problem as a Constraint Satisfaction Problem (CSP), the aim of this article is to improve its optimisation, while considering multiple objectives. Using an existing evolutionary optimisation algorithm as a basis, we propose an approach that reduces the computation time required for optimisation. The idea is first to quickly compute a rough Pareto of solutions, then ask the user to select an area of interest, and finally to launch a second computation on this restricted area. After an introduction to the problem, the approach is explained and the algorithm adaptations are presented. Then various computation experiments results demonstrate that computation times are significantly reduced while keeping the optimality level.