arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2511.09563cs.AImath.CO
收藏

通过部分JRA和大α优化实现联合路由分配问题的高效且近似最优求解器

An Efficient and Almost Optimal Solver for the Joint Routing-Assignment Problem via Partial JRA and Large-α Optimization

Singapore Institute of Technology(新加坡理工学院)

Qilong Yuan

AI总结:

针对联合路由分配(JRA)问题精确求解器在大规模实例中效率低的局限,提出融合部分路径重构(PPR)求解器和大α约束的PJAR框架,在大规模基准数据集上实现0.00%平均偏差且保持高效,还可扩展至TSP等问题。

摘要:

联合路由分配(JRA)优化问题需同时确定物品到占位符的分配,以及恰好访问每个节点对一次的哈密顿回路,目标是最小化总旅行成本。此前研究提出了精确混合整数规划(MIP)求解器,还提供了数据集和Gurobi实现,结果显示精确方法虽能保证最优性,但在大规模实例中计算效率低下。为克服这一局限,研究者提出了基于合并算法和扰动过程的启发式方法,所得解与最优解的偏差约为1%。本工作提出一种新颖且更高效的方法,能为大规模JRA问题提供高精度、近似最优的解。该方法引入部分路径重构(PPR)求解器,先识别关键物品-占位符对以构建简化子问题,高效求解子问题后再优化全局解。借助此PJAR框架,初始启发式合并解可进一步改进,偏差减少一半。此外,可沿优化路径用基于PPR的求解器迭代优化解,得到高精度回路。同时,将全局大α约束纳入JRA模型以进一步提升解的最优性。在n=300、500和1000的基准数据集上的实验评估表明,该方法持续输出近似最优解,与真实最优解的平均偏差为0.00%,且保持高计算效率。除JRA问题外,所提框架和方法具有广泛应用潜力,可应用于旅行商问题(TSP)及相关优化问题。

英文摘要:

The Joint Routing-Assignment (JRA) optimization problem simultaneously determines the assignment of items to placeholders and a Hamiltonian cycle that visits each node pair exactly once, with the objective of minimizing total travel cost. Previous studies introduced an exact mixed-integer programming (MIP) solver, along with datasets and a Gurobi implementation, showing that while the exact approach guarantees optimality, it becomes computationally inefficient for large-scale instances. To overcome this limitation, heuristic methods based on merging algorithms and shaking procedures were proposed, achieving solutions within approximately 1% deviation from the optimum. This work presents a novel and more efficient approach that attains high-accuracy, near-optimal solutions for large-scale JRA problems. The proposed method introduces a Partial Path Reconstructon (PPR) solver that first identifies key item-placeholder pairs to form a reduced subproblem, which is solved efficiently to refine the global solution. Using this PJAR framework, the initial heuristic merging solutions can be further improved, reducing the deviation by half. Moreover, the solution can be iteratively polished with PPR based solver along the optimization path to yield highly accurate tours. Additionally, a global Large-α constraint is incorporated into the JRA model to further enhance solution optimality. Experimental evaluations on benchmark datasets with n = 300, 500, and 1000 demonstrate that the proposed method consistently delivers almost optimal solutions, achieving an average deviation of 0.00% from the ground truth while maintaining high computational efficiency. Beyond the JRA problem, the proposed framework and methodologies exhibit strong potential for broader applications. The Framework can be applied to TSP and related optimization problems.

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

↑