Courier assignment in meal delivery via integer programming: A case study in Rome
为一家意大利餐食配送公司开发了骑手分配优化模型，通过整数线性规划最小化延迟和拒单，并在罗马真实数据上验证了有效性。
We present an optimization model for assigning orders to couriers developed for an Italian meal delivery firm focusing on Rome. The firm focuses on top-end restaurants and customers and pursues high Quality of Service through careful management of delays. Our model reflects that in the firm’s business, the majority of orders are placed in advance. This took us to design a sequential decision process implementing a rolling horizon approach where we do not try to anticipate future demands. We, therefore, iterate the solution of a fully deterministic optimization problem, the Offline Couriers Assignment Problem ( ocap ), where we assume full knowledge of the orders and aim at minimizing delays and rejections. We solve ocap through integer linear programming and in particular by a “flow-like” formulation on a suitable network whose size is kept as small as possible. We validate both the quality of this formulation and the sequential decision process through some computational tests on real instances collected on the ground. We make these instances available to the scientific community. • An optimization model for assigning meal orders to couriers. • An effective flow-like integer linear programming formulation. • A deterministic sequential decision process for solving the dynamic version. • Test on real instances collected on the ground and made available for the community.