A model and a metaheuristic method for the Hub Location Routing Problem and application to postal services
A model and a metaheuristic method for the Hub Location Routing Problem and application to postal services
复制标题
枢纽位置路由问题的模型和元启发式方法及其在邮政服务中的应用
DOI：
10.1109/iesm.2015.7380332
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
Mi Zhang
中科院分区：
文献类型：
--
作者：
Nathalie Bostel;P. Dejax;Mi Zhang
本文讨论了货运供应商的零担运输物流网络设计问题。这些公司必须从多个来源（供应商）收集产品，通过多站路线将其运往多个目的地（客户），并将流量整合到枢纽，以实现规模经济。这个问题被称为枢纽位置路由问题（HLRP），它的应用涉及到一般商品的分配以及邮政服务。主要的决策涉及枢纽的位置、枢纽的起点和终点节点的分配、为起点和终点节点服务的路线的设计以及枢纽之间流量的确定。在本文中，我们提出了一个数学模型的HLRP与容量的枢纽和单一的分配，专用于邮政服务系统，收集和交付可能会发生在同一路线。提出了一种基于遗传算法的启发式算法，并通过迭代局部搜索来改进该算法。实验进行的实例改编自澳大利亚邮政（AP）的数据集。与标准求解器的比较证明了所提出的方法的效率。
This paper discusses the problem of designing a logistic network for Less Than Truckload (LTL) shipments of freight transport providers. These companies have to collect products from many origins (suppliers) and ship them to many destinations (clients) through multi-stop routes and consolidate flows into hubs to achieve economies of scale. This problem is known as the Hub Location Routing Problem (HLRP) and its applications relate to the distribution of general goods as well as to postal services. The main decisions concern the location of hubs, the allocation of origin and destination nodes to the hubs, as well as the design of routes serving origin and destination nodes and determination of flows between hubs. In this paper, we propose a mathematical model for the HLRP with capacity on hubs and single allocation, dedicated to postal service systems, where collections and deliveries may occur within the same routes. A metaheuristic method based on a genetic algorithm, improved by an iterative local search is developed to solve the problem. Experiments are conducted on instances adapted from the Australian Post (AP) data set. Comparison with a standard solver proves the efficiency of the proposed method.