SAT and Hybrid Models of the Car Sequencing Problem

Artigues, Christian; Hébrard, Emmanuel; Mayer-Eichberger, Valentin; Siala, Mohamed; Walsh, Toby

doi:10.1007/978-3-319-07046-9_19

Cited by 5 publications

(4 citation statements)

References 21 publications

(25 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Car Sequencing problem was originally defined as a Constraint Satisfaction Problem (CSP) [1,15] that aims to allocate a set of cars on a production line of options' installation over a fixed number of timeslots (e.g. one day of timeslots).…”

Section: Problem Definitionmentioning

confidence: 99%

Variable-Relationship Guided LNS for the Car Sequencing Problem

Souza

Grimes

O’Sullivan

2023

Communications in Computer and Information Science

View full text Add to dashboard Cite

Large Neighbourhood Search (LNS) is a powerful technique that applies the “divide and conquer” principle to boost the performance of solvers on large scale Combinatorial Optimization Problems. In this paper we consider one of the main hindrances to the LNS popularity, namely the requirement of an expert to define a problem specific neighborhood. We present an approach that learns from problem structure and search performance in order to generate neighbourhoods that can match the performance of domain specific heuristics developed by an expert. Furthermore, we present a new objective function for the optimzation version of the Car Sequencing Problem, that better distinguishes solution quality.Empirical results on public instances demonstrate the effectiveness of our approach against both a domain specific heuristic and state-of-the-art generic approaches.

show abstract

Section: Problem Definitionmentioning

confidence: 99%

Variable-Relationship Guided LNS for the Car Sequencing Problem

Souza

Grimes

O’Sullivan

2023

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…An Arc corresponds to a choice in a decomposition. Artigues et al 2014). Currently, the focus is on decompositions of ALL-DIFFERENT to extend the LCG solver CHUFFED to take advantage of the JIT-HCD approach.…”

Section: A Concrete Example: All-differentmentioning

confidence: 99%

Just-in-Time Hierarchical Constraint Decomposition

Mayer-Eichberger

2015

AAAI

Self Cite

View full text Add to dashboard Cite

Lazy Clause Generation (LCG) solvers dominate the current constraint programming competitions. These solvers successfully combine systematic propagation based search, global constraints and conflict clause learning from SAT solving into a hybrid approach. My research project extends the LCG methodology by using a mix of eager and lazy encodings and a richer set of constraint decompositions. Global Constraints exhibit a whole hierarchy of different decomposition into more basic constraints. In our work we want to take advantage of such hierarchies and identify criteria on how constraints could be decomposed before and during search.

show abstract

“…It is used in a wide field of applications, such as planning and scheduling [3,22,19], the verification of hardware and software [17], computation of tree decompositions [13,11]. For example, it can be effectively used to design optimal sorting networks [24] or solve the pythagorean triple problem [35].…”

Section: Introductionmentioning

confidence: 99%

Tuning Parallel SAT Solvers

Ehlers¹,

Nowotka²

2018

EasyChair Preprints

View full text Add to dashboard Cite

In this paper we present new implementation details and benchmarking results for our parallel portfolio solver TopoSAT2. In particular, we discuss ideas and implementation details for the exchange of learned clauses in a massively-parallel SAT solver which is designed to run more that 1, 000 solver threads in parallel. Furthermore, we go back to the roots of portfolio SAT solving, and discuss the impact of diversifying the solver by using different restart-, branching-and clause database management heuristics. We show that these techniques can be used to tune the solver towards different problems. However, in a case study on formulas derived from Bounded Model Checking problems we see the best performance when using a rather simple clause exchange strategy. We show details of these tests and discuss possible explanations for this phenomenon.As computing times on massively-parallel clusters are expensive, we consider it especially interesting to share these kind of experimental results.

show abstract

SAT and Hybrid Models of the Car Sequencing Problem

Cited by 5 publications

References 21 publications

Variable-Relationship Guided LNS for the Car Sequencing Problem

Variable-Relationship Guided LNS for the Car Sequencing Problem

Just-in-Time Hierarchical Constraint Decomposition

Tuning Parallel SAT Solvers

Contact Info

Product

Resources

About