arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2109.03539eess.SYcs.SY
收藏

按需配送系统中车队运营商与激励感知客户的合作运营:一种双层方法

Cooperative Operation of the Fleet Operator and Incentive-aware Customers in an On-demand Delivery System: A Bi-level Approach

Canqi Yao, Shibo Chen, Zaiyue Yang

AI总结:

本文提出一种双层优化方法,通过折扣激励客户提供配送时间灵活性,实现车队运营商与客户合作,降低配送费用和运营成本,达到双赢。

摘要:

本文研究了按需配送系统中车队运营商与激励感知客户之间的合作运营问题。具体而言,车队运营商通过提供运输费用折扣,以换取客户的配送时间灵活性。为了捕捉车队运营商与客户之间的交互,提出了一种新颖的双层优化框架。通过利用强对偶性和客户优化问题的KKT最优性条件,我们将双层优化问题重构为混合整数非线性规划问题。考虑到MINLP的固有困难,设计了一种计算高效的算法,该算法结合了拉格朗日对偶分解和Benders分解的优点,以分布式方式求解所得的MINLP问题。最后,大量的数值实验表明,所提出的合作方案能够降低客户的配送费用,同时减少车队运营商的运营成本,从而实现双方的共赢。

英文摘要:

In this paper, we study the cooperative operation problem between the fleet operator and incentive-aware customers in an on-demand delivery system. Specifically, the fleet operator offers discounts on transportation costs in exchange of the delivery time flexibility of customers. In order to capture the interaction between the fleet operator and customers, a novel bi-level optimization framework is proposed. By exploiting the strong duality, and the KKT optimality condition of customer optimization problems, we can reformulate the bi-level optimization problem as a mixed integer nonlinear programming problem. Considering the inherent difficulties of MINLP, a computationally efficient algorithm, which combines the merits of Lagrangian dual decomposition and Benders decomposition, is devised to solve the resulting MINLP problem in a distributed manner. Finally, extensive numerical experiments demonstrate that the proposed cooperation scheme can decrease the delivery fees for the customers, and reduce the operation cost of the fleet operator at the same time, thus leading to a win-win situation for both sides.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑