arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.06889math.OCcs.NI
收藏

基于资源时空网络表示的资源补给站选址-路由问题

Solving Resource Recharging Station Location-routing Problem through a Resource-space-time Network Representation

Gongyuan Lu, Xuesong Zhou, Qiyuan Peng, Bisheng He, Monirehalsadat Mahmoudi, Jun Zhao

摘要:

资源补给站选址路径问题是具有复杂和关键的资源消耗和补给约束的选址路径问题的推广。基于离散非循环资源时空网络的表示,我们提出了一个通用的配方,以优化动态基础设施的位置和路线的决策。所提出的整数线性规划公式可以通过一个结构良好的多维网络,大大简化了建模表示的时间窗口,资源的变化,和子巡回约束。提出了一种基于拉格朗日松弛的近似求解框架,将问题分解为选择充电站的背包子问题和时空网络中的车辆路径子问题。这两个子问题都可以通过动态规划算法求解,得到最优解。通过大量的实验验证了基于拉格朗日乘子调整的位置路由决策方法以及算法在大规模网络中的有效性。

英文摘要:

The resource recharging station location routing problem is a generalization of the location routing problem with sophisticated and critical resource consumption and recharging constraints. Based on a representation of discretized acyclic resource-space-time networks, we propose a generic formulation to optimize dynamic infrastructure location and routes decisions. The proposed integer linear programming formulation could greatly simplify the modeling representation of time window, resource change, and sub-tour constraints through a well-structured multi-dimensional network. An approximation solution framework based on the Lagrangian relaxation is developed to decompose the problem to a knapsack sub-problem for selecting recharging stations and a vehicle routing sub-problem in a space-time network. Both sub-problems can be solved through dynamic programming algorithms to obtain optimal solution. A number of experiments are used to demonstrate the Lagrangian multiplier adjustment-based location routing decision making, as well as the effectiveness of the developed algorithm in large-scale networks.

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

↑