IDEAS home Printed from https://ideas.repec.org/p/zbw/htwlog/18.html
   My bibliography  Save this paper

Tactical planning of sugarcane harvest and transport operations

Author

Listed:
  • Aliano Filho, Angelo
  • Melo, Teresa
  • Pato, Margarida Vaz

Abstract

Motivated by a real situation arising in the Brazilian sugarcaneindustry, this paper addresses the integrated planning of harvest and transport operations over a multi-period planning horizon. The aim is to develop a schedule for the deployment of harvest and transport equipment that specifies the periods for the execution of the harvest operations on the sugarcane fields, and the type of harvesting machines and transport vehicles to be operated. These decisions are made subject to multiple constraints related to the projected crop yield, resource availability, demand for sugarcane at the mills, and further technical requirements specific to the harvest operations. The tactical plan to be determined minimizes the total cost incurred by the equipment used and the total time required to harvest all the fields. We propose a bi-objective mixed-integer non-linear programming model for this new problem. A computational study is conducted for test instances capturing the characteristics of a Brazilian milling company. Pareto-optimal solutions are identified by the Progressive Bounded Constraint Method that is extended to the problem at hand. A comparative analysis highlights the trade-offs between economic performance and harvest efficiency, thereby supporting the decision maker in making a more informed choice of the preferred tactical plan. Useful managerial insights are also provided into the profile of the harvest and transport resources that should be used under different weather conditions and work schedules.

Suggested Citation

  • Aliano Filho, Angelo & Melo, Teresa & Pato, Margarida Vaz, 2020. "Tactical planning of sugarcane harvest and transport operations," Technical Reports on Logistics of the Saarland Business School 18, Saarland University of Applied Sciences (htw saar), Saarland Business School.
  • Handle: RePEc:zbw:htwlog:18
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/224073/1/1728063132.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Multi-objective optimization; Mixed-integer Programming; Sugarcane harvest and transport planning;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:zbw:htwlog:18. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/fwhsade.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.