A multi-start optimization-based heuristic for a food bank distribution problem
研究了食品银行向远距离非营利组织配送托盘货物的车辆路径分配问题，提出一种多起点启发式算法，在解质量和计算效率上优于现有方法，最优性差距常低于0.5%。
We investigate a variant of the vehicle routing-allocation problem that arises in the distribution of pallets of goods by a food bank to a network of relatively distant nonprofit organizations. Vehicles are routed to selected intermediate delivery sites to which the nonprofit organizations travel to collect their demand. The logistical cost is shared, and the objective is to minimize a weighted average of the food bank vehicle routing cost and the travel cost of the nonprofit organizations. This paper develops an efficient multi-start heuristic that iteratively constructs the initial solutions to this problem and subsequently explores their neighborhoods via local improvement and perturbation schemes. In our experience, the proposed heuristic substantially outperforms alternative optimization-based heuristics in the literature in terms of the solution quality and computational efficiency and yields solutions with an optimality gap often below 0.5%.