Abstract
The problem of configuring the variability models is pervasive in plenty of domains. Renault, a leading automobile manufacturer, has developed an internal product configuration system to model its vehicle diversity. This system is based on the well-known knowledge compilation approach and is associated with a set of parameters. Different input parameters have a strong influence on the system’s performance. The parameters actually used are determined manually. Our work aims to study and determine these parameters automatically. This paper studies Renault’s variability models and product configuration system and presents a parameter prediction model for this system. The results show the predicted parameters’ competitiveness compared with the parameters by default.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Here, “compilation” refers to the process of building the configuration space in knowledge compilation terminology.
- 2.
The daily parameter is also called the production parameter, which is manually determined and updated by the system developers.
- 3.
The degree of a vertex in an undirected graph is the number of edges incident with (meeting at or ending at) itself [16].
References
Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. 27(06), 509–516 (1978)
Berger, T., et al.: A survey of variability modeling in industrial practice. In: Gnesi, S., Collet, P., Schmid, K. (eds.) The Seventh International Workshop on Variability Modelling of Software-intensive Systems, VaMoS 2013, Pisa, Italy, 23–25 January 2013, pp. 7:1–7:8. ACM (2013)
Ansótegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142–157. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04244-7_14
Barthelemy, M.: Betweenness centrality in large complex networks. Eur. Phys. J. B 38(2), 163–168 (2004)
Bartz-Beielstein, T., Flasch, O., Koch, P., Konen, W., et al.: SPOT: a toolbox for interactive and automatic tuning in the R environment. In: Proceedings, vol. 20, pp. 264–273 (2010)
Becker, A., Geiger, D.: A sufficiently fast algorithm for finding close to optimal clique trees. Artif. Intell. 1–2, 3–17 (2001)
Belkhir, N., Dréo, J., Savéant, P., Schoenauer, M.: Feature based algorithm configuration: a case study with differential evolution. In: Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 156–166. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45823-6_15
Belkhir, N., Dréo, J., Savéant, P., Schoenauer, M.: Per instance algorithm configuration of CMA-ES with limited budget. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 681–688 (2017)
Bernard, P.: Extending cluster tree compilation with non-Boolean variables in product configuration: a tractable approach to preference-based configuration. In: Proceedings of the IJCAI, vol. 3. Citeseer (2003)
Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163–177 (2001)
Choi, A., Darwiche, A.: Dynamic minimization of sentential decision diagrams. In: desJardins, M., Littman, M.L. (eds.) Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 14–18 July 2013, Bellevue, Washington, USA. AAAI Press (2013)
Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229–264 (2002)
Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 777–784 (2017)
El Yafrani, M., Scoczynski, M., Sung, I., Wagner, M., Doerr, C., Nielsen, P.: MATE: a model-based algorithm tuning engine: a proof of concept towards transparent feature-dependent parameter tuning using symbolic regression. In: Zarges, C., Verel, S. (eds.) EvoCOP 2021. LNCS, vol. 12692, pp. 51–67. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-72904-2_4
Frazier, P.I.: Bayesian optimization. In: Recent Advances in Optimization and Modeling of Contemporary Problems, pp. 255–278. Informs (2018)
Grami, A.: Chapter 18 - graphs. In: Grami, A. (ed.) Discrete Mathematics, pp. 327–350. Academic Press (2023). https://doi.org/10.1016/B978-0-12-820656-0.00018-6, https://www.sciencedirect.com/science/article/pii/B9780128206560000186
Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 186–202. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13520-0_23
Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507–523. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25566-3_40
Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267–306 (2009)
Hutter, F., Lindauer, M., Balint, A., Bayless, S., Hoos, H., Leyton-Brown, K.: The configurable sat solver challenge (CSSC). Artif. Intell. 243, 1–25 (2017)
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43–58 (2016)
Noble, W.S.: What is a support vector machine? Nat. Biotechnol. 24(12), 1565–1567 (2006)
Pargamin, B.: Vehicle sales configuration: the cluster tree approach. In: ECAI 2002 Configuration Workshop, pp. 35–40 (2002)
Pohl, R., Lauenroth, K., Pohl, K.: A performance comparison of contemporary algorithmic approaches for automated analysis operations on feature models. In: 2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011), pp. 313–322. IEEE (2011)
Rodriguez-Galiano, V., Sanchez-Castillo, M., Chica-Olmo, M., Chica-Rivas, M.: Machine learning predictive models for mineral prospectivity: an evaluation of neural networks, random forest, regression trees and support vector machines. Ore Geol. Rev. 71, 804–818 (2015)
Tarjan, R.: Enumeration of the elementary circuits of a directed graph. SIAM J. Comput. 2(3), 211–216 (1973)
Weisberg, S.: Applied Linear Regression, vol. 528. Wiley, Hoboken (2005)
Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Comb. Probab. Comput. 22(2), 294–318 (2013)
Xu, H., Baarir, S., Ziadi, T., Essodaigui, S., Bossu, Y., Messan Hillah, L.: An experience report on the optimization of the product configuration system of Renault. In: 2023 27th International Conference on Engineering of Complex Computer Systems (ICECCS), pp. 197-206. IEEE Computer Society (2023)
Xu, H., Baarir, S., Ziadi, T., Essodaigui, S., Bossu, Y., Messan Hillah, L.: Optimization of the product configuration system of Renault. In: Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, pp. 1486–1489 (2023)
Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for sat. J. Artif. Intell. Res. 32, 565–606 (2008)
Zhu, H., Williams, C.K., Rohwer, R., Morciniec, M.: Gaussian regression and optimal finite dimensional linear models (1997)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Xu, H., Baarir, S., Ziadi, T., Essodaigui, S., Bossu, Y. (2025). Automated Parameter Determination for Enhancing the Product Configuration System of Renault: An Experience Report. In: Bai, G., Ishikawa, F., Ait-Ameur, Y., Papadopoulos, G.A. (eds) Engineering of Complex Computer Systems. ICECCS 2024. Lecture Notes in Computer Science, vol 14784 . Springer, Cham. https://doi.org/10.1007/978-3-031-66456-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-66456-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-66455-7
Online ISBN: 978-3-031-66456-4
eBook Packages: Computer ScienceComputer Science (R0)