Scheduling Food Bank Collections and Deliveries to Ensure Food Safety and Improve Access

Food banks are privately-owned non-profit organizations responsible for the receipt, processing, storage, and distribution of food items to charitable agencies. These charitable agencies in turn distribute food to individuals at risk of hunger. Food banks receive donated food from national and local sources, such as The Emergency Food Assistance Program (TEFAP) and supermarkets. Local sources with frequent high-volume donations justify the use of food bank vehicles for collection. Food bank vehicles are also used to deliver food to rural charitable agencies that are located beyond a distance safe for perishable food to travel without spoilage. Due to limited funds, food banks can only afford to sparingly use their capital on non-food items. This requires exploring more cost effective food delivery and collection strategies. The goal of this paper is to develop transportation schedules that enable the food bank to both (i) collect food donations from local sources and (ii) to deliver food to charitable agencies. We identify satellite locations, called food delivery points (FDPs), where agencies can receive food deliveries. A set covering model is developed to determine the assignment of agencies to an FDP. Both vehicle capacity and food spoilage constraints are considered during assignment. Using the optimal assignment of agencies to FDPs, we identify a weekly transportation schedule that addresses collection and distribution of donated food and incorporates constraints related to food safety, operator workday, collection frequency, and fleet capacity.

[1]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[2]  Chunyu Ren,et al.  Study on hybrid genetic algorithm for multi-type vehicles vehicle routing problem with backhauls , 2009, 2009 6th International Conference on Service Systems and Service Management.

[3]  John E. Beasley,et al.  A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions , 2008, J. Oper. Res. Soc..

[4]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[5]  Christos D. Tarantilis,et al.  Advanced vehicle routing algorithms for complex operations management problems , 2005 .

[6]  James C. Ohls,et al.  The Emergency Food Assistance System: Findings from the Provider Survey. Volume 1. Princeton, NJ: Mathematica Policy Research , 2002 .

[7]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[8]  Michal Tzur,et al.  The Period Vehicle Routing Problem with Service Choice , 2006, Transp. Sci..

[9]  Karen Renee Smilowitz,et al.  Modeling Techniques for Periodic Vehicle Routing Problems , 2006 .

[10]  Gilbert Laporte,et al.  A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem , 2003, Eur. J. Oper. Res..

[11]  Christina R. Scherrer,et al.  The stop-and-drop problem in nonprofit food distribution networks , 2014, Ann. Oper. Res..

[12]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[13]  Alisha J. Coleman-Jensen,et al.  Household Food Security in the United States in 2011 Statistical Supplement , 2013 .

[14]  Michael T. Marsh,et al.  Equity measurement in facility location analysis: A review and framework , 1994 .

[15]  Seyed M. R. Iravani,et al.  Sequential Resource Allocation for Nonprofit Operations , 2014, Oper. Res..

[16]  Jean-Yves Potvin,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows , 1997, Transp. Sci..

[17]  Raymond K. Cheung,et al.  Multi-attribute label matching algorithms for vehicle routing problems with time windows and backhauls , 2003 .

[18]  Richard W. Eglese,et al.  The grocery superstore vehicle scheduling problem , 2005, J. Oper. Res. Soc..

[19]  Hakan Yildiz,et al.  A Genetic Algorithm for the Home-Delivered Meals Location-Routing Problem , 2005 .

[20]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..

[21]  Frits C. R. Spieksma,et al.  On a periodic vehicle routing problem , 2010, J. Oper. Res. Soc..

[22]  L A N Lorena,et al.  Genetic algorithms applied to computationally difficult set covering problems , 1997 .

[23]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[24]  Hokey Min,et al.  Combined location-routing problems: A synthesis and future research directions , 1998, Eur. J. Oper. Res..

[25]  Alisha J. Coleman-Jensen,et al.  Household Food Security in the United States in 2010 , 2011 .

[26]  Paolo Toth,et al.  A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls , 1999, Eur. J. Oper. Res..

[27]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[28]  R. L. Collins,et al.  A Minimal Technology Routing System for Meals on Wheels , 1983 .

[29]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[30]  G. Nemhauser,et al.  Integer Programming , 2020 .