Abstract
The Partner Units Problem (PUP) is a computationally challenging configuration problem with diverse application domains, such as railway safety or electrical engineering. The recently formulated Quick Pup algorithm has made it possible for the first time to automatically derive solutions for real world-sized problems, such that the Partner Units Configuration Problem can be seen as practically solved. Further challenges, which were clearly out of reach before, can be tackled now. This paper addresses two practically relevant problems related to the PUP. The first problem is to calculate solutions for legacy instances of the PUP. The difference to the original PUP is that the solver is given a partial solution which has to be extended to a complete solution. The second problem is about adapting partial legacy solutions which cannot be extended to complete solutions and thus making a consistent complete solution possible. All presented approaches are evaluated on behalf of a newly defined set of benchmark instances.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
