IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v22y1992i3p4-14.html
   My bibliography  Save this article

Interactive Optimization of Bulk Sugar Deliveries

Author

Listed:
  • André van Vliet

    (ORTEC Consultants, Groningenweg 6, 2803 PV Gouda, The Netherlands, and Erasmus University Rotterdam, Econometric Institute, PO Box 1738, 3000 DR Rotterdam, The Netherlands)

  • C. Guus E. Boender

    (ORTEC Consultants, Groningenweg 6, 2803 PV Gouda, The Netherlands, and Erasmus University Rotterdam, Econometric Institute, PO Box 1738, 3000 DR Rotterdam, The Netherlands)

  • Alexander H. G. Rinnooy Kan

    (Erasmus University Rotterdam, Econometric Institute, PO Box 1738, 3000 DR Rotterdam, The Netherlands)

Abstract

An interactive optimization system for planning bulk deliveries was implemented by Suiker Unie, a farming cooperative that processes about 60 percent of the Dutch sugar beet crop. The bulk delivery problem differs in several aspects from the standard multi-depot vehicle-routing problem: trucks deliver full loads to each customer and can reload at any one of five factories. Loading the trucks is very time consuming, and at each factory trucks can only be loaded one at a time, so that the problem includes both scheduling and routing. Since September 1991, the planners of Suiker Unie use the system to interactively determine and adjust daily schedules. In addition to the improvement of the efficiency and quality of the planning process, the use of the system turned out to yield about seven percent savings in operating costs.

Suggested Citation

  • André van Vliet & C. Guus E. Boender & Alexander H. G. Rinnooy Kan, 1992. "Interactive Optimization of Bulk Sugar Deliveries," Interfaces, INFORMS, vol. 22(3), pages 4-14, June.
    • Handle: RePEc:inm:orinte:v:22:y:1992:i:3:p:4-14
    DOI: 10.1287/inte.22.3.4
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.22.3.4
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.22.3.4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Meignan, David & Knust, Sigrid, 2019. "A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization," European Journal of Operational Research, Elsevier, vol. 279(2), pages 320-334.

    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:inm:orinte:v:22:y:1992:i:3:p:4-14. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.