The stop-and-drop problem in nonprofit food distribution networks

DOI10.1007/S10479-012-1068-7MaRDI QIDQ478060zbMATH OpenOpenAlexFDO

Authors Senay Solak, Christina Scherrer, Ahmed F. Ghoniem

Publication date 11 December 2014

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-012-1068-7

zbMATH Keywords

Benders decompositionnonprofit logisticsrouting-location-allocation problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• The Humanitarian pickup and distribution problem
• Modelling the problem of food distribution by the Portuguese food banks
• A food distribution network problem: a case study
• The food bank resource allocation problem
• Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network

Cites work

• scientific article; zbMATH DE number 1550909 (Why is no real title available?)
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• Algorithms for hybrid MILP/CP models for a class of optimization problems
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Improving Discrete Model Representations via Symmetry Considerations
• Integer Programming Formulation of Traveling Salesman Problems
• Locating median cycles in networks
• Location-routing: issues, models and methods
• Logic-based Benders decomposition
• Planning and Scheduling by Logic-Based Benders Decomposition
• Redesign of a recycling system for LPG-tanks
• Sequential resource allocation for nonprofit operations
• The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The vehicle routing-allocation problem: A unifying framework

Cited in

(17)

• Logic-based Benders decomposition for large-scale optimization
• The food bank resource allocation problem
• Modelling the problem of food distribution by the Portuguese food banks
• Dynamic volunteer staffing in multicrop gleaning operations
• Donation management for menu planning at soup kitchens
• A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
• Robust optimization approaches for the equitable and effective distribution of donated food
• Location‐routing problem: a classification of recent research
• Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery
• Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems
• The Humanitarian pickup and distribution problem
• A food distribution network problem: a case study
• Consolidating home meal delivery with limited operational disruption
• Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm
• A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
• Tactical network planning for food aid distribution in Kenya
• A branch-and-price algorithm for a vehicle routing with demand allocation problem

This page was built for publication: The stop-and-drop problem in nonprofit food distribution networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q478060)