Cars are purchased with a set of options (airbags, air conditioned, radio car, etc.) which varies from one client to another. The global cost of option connections is very high in automobile industry and thus it is crucial to produce cars with configurations of active option connections close as possible to the set of options purchased by each client. Furthermore, for technical reasons, it is not possible to produce a large diversity of different option connection configurations.
The main goal of the project is the implementation of an algorithmic strategy
to minimize the diversity of option connection configurations from an universe determined according
to the statistic data about costumer preferences and selling expectations, fulfilling global cost requirements, and also to optimize the minimum cost supply of produced configurations, fulfilling the market requirements and a limit number of configurations. This problem is formalized as the minimum arc cost sum spanning star forest of the inclusion relation configuration digraph, with no more than k stars.