Abstract

We present a novel and practical approach to the Dragon Boat Partition Problem (DBP), in which we need to assign rowers to the opposite sides of a dragon boat, such that certain requirements are satisfied. An example of the requirements is that weights on the right side and left side are balanced. While DBP is essentially an integer partition problem, it has its own unique characteristics. Our approach is greedy and heuristic and tackles DBP effectively, showing its practicality in real applications. The performance of our proposed approach is demonstrated through a set of simulated experiments and various related issued are discussed.

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 call

Disclaimer: 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.