Abstract
The area restriction model for harvest scheduling problems can be formulated using mixed integer programs. The three different formulation types are cluster packing, cell aggregation, and the assignment formulation. Within the cell aggregation subgroup there is an exact formulation, the cover constraint (CC) approach; and an inexact formulation, the stand-centered approach. The cover constraint formulation has significantly more constraints than the stand-centered formulation. A computational comparison between these two methods is completed using cutting planes and constraint combinations using the CPLEX solver package. The CC approach as cutting planes was superior based on solution time. If formulation time were included with solution time, then the CC approach remains superior. The maximum harvest area is a significant factor of solution time. In addition, the percentage of total cutting planes used to solve the problem was examined.
Sign-in/Register to access full text options 
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.
