English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Cable trees are used in industrial products to transmit energy andinformation between different product parts. To this date, they are mostlyassembled by humans and only few automated manufacturing solutions exist usingcomplex robotic machines. For these machines, the wiring plan has to betranslated into a wiring sequence of cable plugging operations to be followedby the machine. In this paper, we study and formalize the problem of derivingthe optimal wiring sequence for a given layout of a cable tree. We summarizeour investigations to model this cable tree wiring Problem (CTW) as a travelingsalesman problem with atomic, soft atomic, and disjunctive precedenceconstraints as well as tour-dependent edge costs such that it can be solved bystate-of-the-art constraint programming (CP), Optimization Modulo Theories(OMT), and mixed-integer programming (MIP) solvers. It is further shown, howthe CTW problem can be viewed as a soft version of the coupled tasks schedulingproblem. We discuss various modeling variants for the problem, prove itsNP-hardness, and empirically compare CP, OMT, and MIP solvers on a benchmarkset of 278 instances. The complete benchmark set with all models and instancedata is available on github and is accepted for inclusion in the MiniZincchallenge 2020.

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