Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics
Abstract: Food rescue organizations collect and re-distribute surplus perishable food for hunger relief. We propose novel approaches to address this humanitarian logistics challenge and find envy-free allocations of the rescued food together with least travel cost routes. We show that this food rescue and delivery problem is NP-hard and we present a cutting-plane algorithm based on Benders’ decomposition for its exact solution. We introduce a novel heuristic algorithm that combines greedy and local search. We test our approaches using real data from food rescue organizations. Our results show that the proposed algorithms are able to efficiently provide envyfree and cost-effective solutions.
Keywords: Humanitarian logistics, pickup and delivery, Benders decomposition, Fairness
Category 1: Applications -- OR and Management Sciences (Transportation )
Category 2: Applications -- OR and Management Sciences (Production and Logistics )
Category 3: Combinatorial Optimization (Branch and Cut Algorithms )
Citation: Rey, D., Almi’ani, K., & Nair, D. J. (2018). Exact and heuristic algorithms for finding envy-free allocations in food rescue pickup and delivery logistics. Transportation Research Part E: Logistics and Transportation Review, 112, 19-46.
Entry Submitted: 03/01/2018
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|