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

DOI10.1007/s10479-012-1068-7zbMath1301.90007OpenAlexW2028817558MaRDI QIDQ478060

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

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

Related Items (11)

The food bank resource allocation problem ⋮ Evolutionary hyperheuristics for location-routing problem with simultaneous pickup and delivery ⋮ Location‐routing problem: a classification of recent research ⋮ Dynamic Volunteer Staffing in Multicrop Gleaning Operations ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Donation management for menu planning at soup kitchens ⋮ A branch-and-price algorithm for a vehicle routing with demand allocation problem ⋮ Robust optimization approaches for the equitable and effective distribution of donated food ⋮ A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands ⋮ The Humanitarian Pickup and Distribution Problem ⋮ A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak

Cites Work

• Unnamed Item
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Location-routing: issues, models and methods
• Logic-based Benders decomposition
• The vehicle routing-allocation problem: A unifying framework
• Redesign of a recycling system for LPG-tanks
• Locating median cycles in networks
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Sequential Resource Allocation for Nonprofit Operations
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Improving Discrete Model Representations via Symmetry Considerations
• Integer Programming Formulation of Traveling Salesman Problems
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Planning and Scheduling by Logic-Based Benders Decomposition
• The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem
• A Heuristic Algorithm for the Vehicle-Dispatch Problem

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