IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v46y2014i12p1279-1297.html
   My bibliography  Save this article

Multi-vehicle sequential resource allocation for a nonprofit distribution system

Author

Listed:
  • Burcu Balcik
  • Seyed Iravani
  • Karen Smilowitz

Abstract

This article introduces a multi-vehicle sequential allocation problem that considers two critical objectives for nonprofit operations: providing equitable service and minimizing unused donations. This problem is motivated by an application in food redistribution from donors such as restaurants and grocery stores to agencies such as soup kitchens and homeless shelters. A set partitioning model is formulated that can be used to design vehicle routes; it primarily focuses on equity maximization and implicitly considers waste. The behavior of the model in clustering agencies and donors on routes is studied, and the impacts of demand variability and supply availability on route composition and solution performance are analyzed. A comprehensive numerical study is performed in order to develop insights on optimal solutions. Based on this study, an efficient decomposition-based heuristic for the problem that can handle an additional constraint on route length is developed and it is shown that the heuristic obtains high-quality solutions in terms of equity and waste.

Suggested Citation

  • Burcu Balcik & Seyed Iravani & Karen Smilowitz, 2014. "Multi-vehicle sequential resource allocation for a nonprofit distribution system," IISE Transactions, Taylor & Francis Journals, vol. 46(12), pages 1279-1297, December.
    • Handle: RePEc:taf:uiiexx:v:46:y:2014:i:12:p:1279-1297
    DOI: 10.1080/0740817X.2013.876240
    as

    Download full text from publisher

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

    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:taf:uiiexx:v:46:y:2014:i:12:p:1279-1297. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.