Optimisation for the product configuration system of Renault: towards an integration of symmetries
Authors: 
Hao Xu, Souheib Baarir, Tewfik Ziadi, Lom Messan Hillah, Siham Essodaigui, Yves BossuAuthors Info & Claims
Hao Xu, Souheib Baarir, Tewfik Ziadi, Lom Messan Hillah, Siham Essodaigui, Yves BossuAuthors Info & ClaimsPages 86 - 90
Abstract
The problem of configuring model variability is widespread in many different domains. Renault, a leading french automobile manufacturer, has developed its technology internally to model vehicle diversity. This technology relies on the approach known as knowledge compilation. Since its inception, continuous progress has been made in the tool while monitoring the latest developments from the software field and academia. However, the growing number of vehicle models brings potential risks and higher requirements for the tool. This paper presents a short reminder of Renault's technology principles and the improvements we intend to achieve by analyzing and leveraging notable data features of Renault problem instances. In particular, the aim is to exploit symmetry properties.
References
[1]
Vikraman Arvind and Johannes Köbler. 2000. Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. In <u>Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS '00).</u> Springer-Verlag, Berlin, Heidelberg, 431--442.
[2]
Jean-Marc Astesana, Laurent Cosserat, and Hélène Fargier. 2010. Constraint-based Vehicle Configuration: A Case Study. In <u>ICTAI (1).</u> IEEE Computer Society, 68--75.
[3]
Gilles Audemard and Laurent Simon. 2009. Glucose: a solver that predicts learnt clauses quality. <u>SAT Competition</u> (2009), 7--8.
[4]
Thorsten Berger, Ralf Rublack, Divya Nair, Joanne M. Atlee, Martin Becker, Krzysztof Czarnecki, and Andrzej Wasowski. 2013. A survey of variability modeling in industrial practice. In <u>The Seventh International Workshop on Variability Modelling of Software-intensive Systems, VaMoS '13, Pisa, Italy, January 23 - 25, 2013</u>, Stefania Gnesi, Philippe Collet, and Klaus Schmid (Eds.). ACM, 7:1--7:8.
[5]
Armin Biere, Katalin Fazekas, Mathias Fleury, and Maximillian Heisinger. 2020. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling Entering the SAT Competition 2020. In <u>Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions (Department of Computer Science Report Series B, Vol. B-2020-1)</u>, Tomas Balyo, Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, and Martin Suda (Eds.). University of Helsinki, 51--53.
[6]
Stephen A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In <u>Proceedings of the Third Annual ACM Symposium on Theory of Computing</u> (Shaker Heights, Ohio, USA) <u>(STOC '71).</u> Association for Computing Machinery, New York, NY, USA, 151--158.
[7]
William F. Dowling and Jean H. Gallier. 1984. Linear-time algorithms for testing the satisfiability of propositional horn formulae. <u>The Journal of Logic Programming</u> 1, 3 (1984), 267--284.
[8]
Jun Gu, Paul W. Purdom, John Franco, and Benjamin W. Wah. 1996. Algorithms for the satisfiability (SAT) problem: A survey. In <u>Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996 (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 35)</u>, Ding-Zhu Du, Jun Gu, and Panos M. Pardalos (Eds.). DIMACS/AMS, 19--151.
[9]
Tommi Junttila and Petteri Kaski. 2007. Engineering an efficient canonical labeling tool for large and sparse graphs. In <u>2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX).</u> SIAM, 135--149.
[10]
Hadi Katebi, Karem A Sakallah, and Igor L Markov. 2010. Symmetry and satisfiability: An update. In <u>International Conference on Theory and Applications of Satisfiability Testing.</u> Springer, 113--127.
[11]
M. R. Krom. 1970. The Decision Problem for Formulas in Prenex Conjunctive Normal Form with Binary Disjunctions. <u>Journal of Symbolic Logic</u> 35, 2 (1970), 210--216.
[12]
Bernard Pargamin. 2002. Vehicle sales configuration: the cluster tree approach. In <u>ECAI 2002 Configuration Workshop.</u> 35--40.
[13]
Bernard Pargamin. 2003. Extending cluster tree compilation with non-boolean variables in product configuration: A tractable approach to preference-based configuration. In <u>Proceedings of the IJCAI</u>, Vol. 3. Citeseer.
[14]
Karem A Sakallah. 2009. Symmetry and Satisfiability. <u>Handbook of Satisfiability</u> 185 (2009), 289--338.
Index Terms
- Optimisation for the product configuration system of Renault: towards an integration of symmetries
Recommendations
Optimization of the Product Configuration System of Renault
SAC '23: Proceedings of the 38th ACM/SIGAPP Symposium on Applied ComputingThe problem of configuring a variability model is widespread in many different domains. Renault has developed its technology internally to model vehicle diversity. This technology relies on the approach known as knowledge compilation to explore the ...
Automated Parameter Determination for Enhancing the Product Configuration System of Renault: An Experience Report
Engineering of Complex Computer SystemsAbstractThe 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 ...
Product-Structuring Concepts for Automotive Platforms: A Systematic Mapping Study
SPLC '23: Proceedings of the 27th ACM International Systems and Software Product Line Conference - Volume AThe products of the automotive industry are facing one of the biggest changes: becoming digital smart devices on wheels. Driven by the rising amount of vehicle functions, electronic control units, and software, today's vehicles are becoming cyber-...
Comments
Information & Contributors
Information
Published In
September 2021
148 pages
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 September 2021
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
SPLC '21
Sponsor:
SPLC '21: 25th ACM International Systems and Software Product Line Conference
September 6 - 11, 2021
Leicester, United Kindom
Acceptance Rates
Overall Acceptance Rate 167 of 463 submissions, 36%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 95Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)0
Reflects downloads up to 25 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in