Where to Build Food Banks and Pantries: A Two-Level Machine Learning Approach
Gavin Ruan, Ziqi Guo, Guang Lin

TL;DR
This paper presents a two-level machine learning framework that optimizes food bank and pantry locations using clustering and routing algorithms, improving accessibility and reducing travel distances for food-insecure households.
Contribution
It introduces a novel two-level optimization approach combining K-Medoids clustering and routing to enhance food pantry placement based on real road distances and socioeconomic factors.
Findings
Optimized locations outperform existing food bank and pantry placements.
Significant reduction in household travel distances to food aid sources.
Framework demonstrates adaptability to socioeconomic considerations.
Abstract
Over 44 million Americans currently suffer from food insecurity, of whom 13 million are children. Across the United States, thousands of food banks and pantries serve as vital sources of food and other forms of aid for food insecure families. By optimizing food bank and pantry locations, food would become more accessible to families who desperately require it. In this work, we introduce a novel two-level optimization framework, which utilizes the K-Medoids clustering algorithm in conjunction with the Open-Source Routing Machine engine, to optimize food bank and pantry locations based on real road distances to houses and house blocks. Our proposed framework also has the adaptability to factor in considerations such as median household income using a pseudo-weighted K-Medoids algorithm. Testing conducted with California and Indiana household data, as well as comparisons with real food…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinTech, Crowdfunding, Digital Finance
