From MiniZinc to Optimization Modulo Theories, and Back

Contaldo, Francesco; Trentin, Patrick; Sebastiani, Roberto

doi:10.1007/978-3-030-58942-4_10

Cited by 6 publications

(10 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The .FZN 1−GC and .FZN 1−GC files can then be further processed with a FlatZinc to SMT2 compiler using OptiMathSAT, specific syntax support for Z3 and OptiMathSAT, and OMT extensions [17,18]. Some information from our models is, however, not translated correctly to these files requiring postprocessing of the files with our own Python script.…”

Section: Overview On Model Variants Instance Data Formats and The Supporting Tool Chainmentioning

confidence: 99%

Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

et al. 2021

View full text Add to dashboard Cite

Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few automated manufacturing solutions exist using complex robotic machines. For these machines, the wiring plan has to be translated into a wiring sequence of cable plugging operations to be followed by the machine. In this paper, we study and formalize the problem of deriving the optimal wiring sequence for a given layout of a cable tree. We summarize our investigations to model this cable tree wiring problem (CTW). as a traveling salesman problem with atomic, soft atomic, and disjunctive precedence constraints as well as tour-dependent edge costs such that it can be solved by state-of-the-art constraint programming (CP), Optimization Modulo Theories (OMT), and mixed-integer programming (MIP). solvers. It is further shown, how the CTW problem can be viewed as a soft version of the coupled tasks scheduling problem. We discuss various modeling variants for the problem, prove its NP-hardness, and empirically compare CP, OMT, and MIP solvers on a benchmark set of 278 instances. The complete benchmark set with all models and instance data is available on github and was included in the MiniZinc challenge 2020.

show abstract

Section: Overview On Model Variants Instance Data Formats and The Supporting Tool Chainmentioning

confidence: 99%

Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

et al. 2021

View full text Add to dashboard Cite

show abstract

“…This library generates another variant of the models and instance data named .FZN 1−GC and .FZN 1−GC supporting global constraints. The .FZN 1−GC and .FZN 1−GC files can then be further processed with a FlatZinc to SMT2 compiler using OptiMathSAT, specific syntax support for Z3 and OptiMathSAT, and OMT extensions [18,17]. Some information from our models is, however, not translated correctly to these files requiring postprocessing of the files with our own Python script.…”

Section: Overview On Model and Data Variants And The Supporting Tool ...mentioning

confidence: 99%

Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Koehler

Bürgler

Fontana

et al. 2020

Preprint

View full text Add to dashboard Cite

Cable trees are used in industrial products to transmit energy and information between different product parts. To this date, they are mostly assembled by humans and only few automated manufacturing solutions exist using complex robotic machines. For these machines, the wiring plan has to be translated into a wiring sequence of cable plugging operations to be followed by the machine.In this paper, we study and formalize the problem of deriving the optimal wiring sequence for a given layout of a cable tree. We summarize our investigations to model this cable tree wiring problem (CTW) as a traveling salesman problem with atomic, soft atomic, and disjunctive precedence constraints as well as tour-dependent edge costs such that it can be solved by state-of-the-art constraint programming (CP), Optimization Modulo Theories (OMT), and mixed-integer programming (MIP) solvers. It is further shown, how the CTW problem can be viewed as a soft version of the coupled tasks scheduling problem. We discuss various modeling variants for the problem, prove its NP-hardness, and empirically compare CP, OMT, and MIP solvers on a benchmark set of 278 instances. The complete benchmark set with all models and instance data is available on github and is accepted for inclusion in the MiniZinc challenge 2020.

show abstract

“…The second question relates to the constraint-based tools and techniques of choice. As shown in the literature, see, e.g., [3,7,10], there is some debate over using constraint-based technologies other than OMT solvers to tackle encodings involving a mixture of arithmetic constraints and cost functions. For this reason, here we compare the performances of two encodings, namely in the SMT-LIB [5] language and in the MiniZinc [1] language.…”

Section: Introductionmentioning

confidence: 99%

Automated Design of Elevator Systems: Experimenting with Constraint-Based Approaches

Demarchi

Menapace

Tacchella

2022

AIxIA 2021 – Advances in Artificial Intelligence

View full text Add to dashboard Cite

System configuration and design is a well-established topic in AI. While many successful applications exists, there are still areas of manufacturing where AI techniques find little or no application. We focus on one such area, namely building and installation of elevator systems, for which we are developing an automated design and configuration tool. The questions that we address in this paper are: (i) What are the best ways to encode some subtasks of elevator design into constraint-based representations? (ii) What are the best tools available to solve the encodings? We contribute an empirical analysis to address these questions in our domain of interest, as well as the complete set of benchmarks to foster further research.

show abstract

From MiniZinc to Optimization Modulo Theories, and Back

Cited by 6 publications

References 43 publications

Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

Cable Tree Wiring -- Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints

Automated Design of Elevator Systems: Experimenting with Constraint-Based Approaches

Contact Info

Product

Resources

About