Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics

Food rescue organizations collect and re-distribute surplus perishable food for hunger relief. The authors propose novel approaches to address this humanitarian logistics challenge and find envy-free allocations of the rescued food together with least travel cost routes. They show that this food rescue and delivery problem is NP-hard and they present a cutting-plane algorithm based on Benders’ decomposition for its exact solution. The authors introduce a novel heuristic algorithm that combines greedy and local search. They test their approaches using real data from food rescue organizations. Their results show that the proposed algorithms are able to efficiently provide envy-free and cost-effective solutions.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01667101
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 21 2018 2:32PM