The stop-and-drop problem in nonprofit food distribution networks
- First Online:
- 554 Downloads
In this paper, we introduce the stop-and-drop problem (SDRP), a new variant of location-routing problems, that is mostly applicable to nonprofit food distribution networks. In these distribution problems, there is a central warehouse that contains food items to be delivered to agencies serving the people in need. The food is delivered by trucks to multiple sites in the service area and partner agencies travel to these sites to pick up their food. The tactical decision problem in this setting involves how to jointly select a set of delivery sites, assign agencies to these sites, and schedule routes for the delivery vehicles. The problem is modeled as an integrated mixed-integer program for which we delineate a two-phase sequential solution approach. We also propose two Benders decomposition-based solution procedures, namely a linear programming relaxation based Benders implementation and a logic-based Benders decomposition heuristic. We show through a set of realistic problem instances that given a fixed time limit, these decomposition based methods perform better than both the standard branch-and-bound solution and the two-phase approach. The general problem and the realistic instances used in the computational study are motivated by interactions with food banks in southeastern United States.
KeywordsNonprofit logistics Routing-location-allocation problems Benders decomposition
- de Souza, L. V., & Siqueira, P. H. (2010). Heuristic methods applied to the optimization school bus transportation routes: a real case. In Proceedings of the 23rd international conference on industrial engineering and other applications of applied intelligent systems: part II (pp. 247–256). Berlin: Springer. Google Scholar
- Feeding America (2009). Local Impact Study, September 2009. http://feedingamerica.org/newsroom/local-impact-study.aspx. Accessed 22 February 2010.
- Food and Agriculture Organization of the United Nations (2009). Food security statistics. http://www.fao.org/economic/ess/food-security-statistics/en/. Accessed 22 February 2010.
- Gunes, C., van Hoeve, W.-J., & Tayur, S. (2010). Vehicle routing for food rescue programs: A comparison of different approaches. In Proceedings of the seventh international conference on integration of AI and OR techniques in constraint programming for combinatorial optimization problems (CPAIOR) (pp. 287–291). Berlin: Springer. Google Scholar
- Hooker, J. N., & Ottosson, G. (2003). Logic-based Benders decomposition. Mathematical Programming, 96, 33–60. Google Scholar
- Hooker, J. N., & Yan, H. (1995). Logic circuit verification by Benders decomposition. In V. Saraswat & P. Van Hentenryck (Eds.), Principles and practice of constraint programming: The newport papers (pp. 267–288). Cambridge: MIT Press. Google Scholar
- Johnson, M. P., & Smilowitz, K. (2008). Community-based operations research. OR/MS Today, 35(1), 22–25. Google Scholar
- Labbé, M., & Laporte, G. (1986). Maximizing user convenience and postal service efficiency in post box location. Belgian Journal of Operations Research, Statistics, and Computer Science, 26(2), 24–33. Google Scholar
- Lien, R., Iravani, S., & Smilowitz, K. (2010). Sequential resource allocation for nonprofit operations (Working paper). Available online at http://www.iems.northwestern.edu/docs/working_papers/WP_10-02.pdf.
- Nord, M., Andrews, M., & Carlson, S. (2008). Household food security in the United States. USDA Economic Research Report No. ERR-83. Google Scholar