IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v69y1997i0p105-11410.1023-a1018968625626.html
   My bibliography  Save this article

A variation of the generalized assignment problem arising in the New Zealand dairy industry

Author

Listed:
  • L.R. Foulds
  • J.M. Wilson

Abstract

Within the New Zealand dairy industry, milk is collected from farms by road tanker vehicles and delivered to the factories of a dairy company for processing. Before the tankers can be scheduled to pick up the milk, each company must decide to which factory the output of each of its client farms is to be sent. We present a mathematical model of this allocation problem and solution procedures for it. The model is a variation on the generalized assignment problem. The problem is NP-hard, which reinforces the search for efficient heuristics for it. We present heuristics which yield solutions close to optimality in a reasonable amount of computing time for problems of the size commonly encountered in the dairy industry. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • L.R. Foulds & J.M. Wilson, 1997. "A variation of the generalized assignment problem arising in the New Zealand dairy industry," Annals of Operations Research, Springer, vol. 69(0), pages 105-114, January.
    • Handle: RePEc:spr:annopr:v:69:y:1997:i:0:p:105-114:10.1023/a:1018968625626
    DOI: 10.1023/A:1018968625626
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018968625626
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018968625626?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Salim Haddadi, 2019. "Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem," 4OR, Springer, vol. 17(3), pages 261-295, September.
    2. T Öncan & S N Kabadi & K P K Nair & A P Punnen, 2008. "VLSN search algorithms for partitioning problems using matching neighbourhoods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 388-398, March.
    3. Bilge Bilgen & Yelda Çelebi, 2013. "Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling," Annals of Operations Research, Springer, vol. 211(1), pages 55-82, December.
    4. Masson, Renaud & Lahrichi, Nadia & Rousseau, Louis-Martin, 2016. "A two-stage solution method for the annual dairy transportation problem," European Journal of Operational Research, Elsevier, vol. 251(1), pages 36-43.
    5. L Tansini & O Viera, 2006. "New measures of proximity for the assignment algorithms in the MDVRPTW," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 241-249, March.
    6. Zhou Xu & Brian Rodrigues, 2015. "A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 636-645, November.
    7. Ken Darby-Dowman & James Little, 1998. "Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming," INFORMS Journal on Computing, INFORMS, vol. 10(3), pages 276-286, August.

    More about this item

    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:spr:annopr:v:69:y:1997:i:0:p:105-114:10.1023/a:1018968625626. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.