Optimization of Travelling Salesman Problem with Precedence Constraint Using Modified GA Encoding

Rashid, Mamunur; Masitah, Jusop; Mohamed, Nik Abdullah Nik; M., Romlay F. R.

doi:10.1166/asl.2018.10775

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CTW problem can be considered as a variant of the traveling salesman problem (TSP) where cavities represent cities that need to be visited. TSP variants with precedence constraints have been studied in a number of papers with [35] being one of the first references, but see also [42,52] for more recent overviews. The CTW problem can also be considered as a variant of the pickup and delivery TSP problem, where the pickup and delivery locations can be exchanged with each other, but the tour should visit them directly.…”

Section: Relationship Of Ctw To Tspmentioning

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: Relationship Of Ctw To Tspmentioning

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

“…The CTW problem can be considered a variant of the traveling salesman problem (TSP) where cavities represent cities that need to be visited. TSP variants with precedence constraints have been studied in a number of papers with [34] being one of the first references, but see also [40,51] for more recent overviews. Note that the CTW problem can also be considered as a variant of the pickup and delivery TSP problem, where the pickup and delivery locations can be exchanged with each other, but the tour should visit them directly.…”

Section: Relationship Of Ctw To Tspmentioning

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

Optimization of Travelling Salesman Problem with Precedence Constraint Using Modified GA Encoding

Cited by 2 publications

References 0 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

Contact Info

Product

Resources

About