论文标题

使用轨迹数据挖掘与随机客户解决动态电容的车辆路由问题的多机构系统

A Multi-Agent System for Solving the Dynamic Capacitated Vehicle Routing Problem with Stochastic Customers using Trajectory Data Mining

论文作者

Fonseca-Galindo, Juan Camilo, Surita, Gabriela de Castro, Neto, José Maia, de Castro, Cristiano Leite, Lemos, André Paim

论文摘要

电子商务的全球增长为物流公司带来了新的挑战,其中之一就是能够以低成本的价格交付产品,这直接反映了分类包裹的方式,需要消除诸如存储和批量创建之类的步骤。我们的工作提出了一个多代理系统,该系统使用轨迹数据挖掘技术来提取领土模式,并将其用于最后一英里路线的动态创建。该问题可以与随机客户(因此是NP-HARD)建模为动态电容的车辆路由问题(VRP),这使得其实现对许多软件包的实现是不可行的。这项工作的主要贡献是仅根据仓库系统配置而不是处理的包装数量来解决此问题,这适用于电子商务产品交付中通常存在的大数据方案。进行了用于单台和多仓库实例的计算实验。由于其概率性质,与静态VRP算法相比,所提出的方法的性能略低。但是,我们的解决方案提供的运营收益使其对于必须动态设置路线的情况非常有吸引力。

The worldwide growth of e-commerce has created new challenges for logistics companies, one of which is being able to deliver products quickly and at low cost, which reflects directly in the way of sorting packages, needing to eliminate steps such as storage and batch creation. Our work presents a multi-agent system that uses trajectory data mining techniques to extract territorial patterns and use them in the dynamic creation of last-mile routes. The problem can be modeled as a Dynamic Capacitated Vehicle Routing Problem (VRP) with Stochastic Customer, being therefore NP-HARD, what makes its implementation unfeasible for many packages. The work's main contribution is to solve this problem only depending on the Warehouse system configurations and not on the number of packages processed, which is appropriate for Big Data scenarios commonly present in the delivery of e-commerce products. Computational experiments were conducted for single and multi depot instances. Due to its probabilistic nature, the proposed approach presented slightly lower performances when compared to the static VRP algorithm. However, the operational gains that our solution provides making it very attractive for situations in which the routes must be set dynamically.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源