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

基于交互式参考点的有指导局部搜索求解双目标库存路径问题

Interactive Reference Point-Based Guided Local Search for the Bi-objective Inventory Routing Problem

Université de Bretagne-Sud(南布列塔尼大学)

Sandra Huber, Martin Josef Geiger, Marc Sevaux

摘要:

获取决策者的偏好是将搜索和决策成功结合在交互式方法中的关键因素。因此,逐步集成和模拟的决策者是一个主要关注的应用程序。在这个方向上,我们提出了一个基于参考点的指导本地搜索的双目标库存路由问题的交互式方法。随后获得的车辆路径问题的本地搜索元启发式,工作的交付间隔,和克拉克和赖特储蓄启发式。为了获得偏好,决策者选择一个参考点,以指导在感兴趣的次区域进行搜索。此外,参考点被用作保留点,以丢弃锥外的解决方案,作为一个收敛准则。基准数据的参考点为基础的引导局部搜索的计算结果的报告和分析,以显示该方法的适用性。

英文摘要:

Eliciting preferences of a decision maker is a key factor to successfully combine search and decision making in an interactive method. Therefore, the progressively integration and simulation of the decision maker is a main concern in an application. We contribute in this direction by proposing an interactive method based on a reference point-based guided local search to the bi-objective Inventory Routing Problem. A local search metaheuristic, working on the delivery intervals, and the Clarke & Wright savings heuristic is employed for the subsequently obtained Vehicle Routing Problem. To elicit preferences, the decision maker selects a reference point to guide the search in interesting subregions. Additionally, the reference point is used as a reservation point to discard solutions outside the cone, introduced as a convergence criterion. Computational results of the reference point-based guided local search are reported and analyzed on benchmark data in order to show the applicability of the approach.

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

↑