当前位置: X-MOL 学术Ann. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach
Annals of Operations Research ( IF 4.8 ) Pub Date : 2021-06-07 , DOI: 10.1007/s10479-021-04137-6
Fatih Kocatürk , G. Yazgı Tütüncü , Said Salhi

In this paper, we investigate the Multi-Depot Heterogeneous VRP with Backhauls. Though the problem is a generalisation of three existing routing problems, this is the first time this combined routing problem is investigated. A mathematical formulation is first presented followed by some tightening. A powerful and novel hybridisation of Variable Neighbourhood Search (VNS) with the Greedy Randomized Adaptive Memory Programming Search is proposed. As there are no problem instances available for bench-marking and evaluation purposes, we generated data sets by combining those from existing vehicle routing problems. The proposed meta-heuristic obtains a number of optimal solutions for small instances and yields about \(13\%\) gap from the lower bounds compared to nearly \(40\%\) and \(20\%\) average gap values for our CPLEX implementation and the VNS without hybridisation, respectively.



中文翻译:

具有回程的多站点异构 VRP:公​​式和具有 GRAMPS 元启发式方法的混合 VNS

在本文中,我们研究了具有回程的多站点异构 VRP。尽管该问题是三个现有路由问题的概括,但这是第一次研究这种组合路由问题。首先提出一个数学公式,然后进行一些紧缩。提出了一种强大而新颖的可变邻域搜索 (VNS) 与贪婪随机自适应内存编程搜索的混合。由于没有可用于基准和评估目的的问题实例,我们通过结合现有车辆路径问题中的数据集来生成数据集。所提出的元启发式为小实例获得了许多最佳解决方案,并且与接近\(40\%\)相比,从下限产生了大约\(13\%\) 的差距,并且\(20\%\)我们的 CPLEX 实现和没有杂交的 VNS 的平均间隙值。

更新日期:2021-06-07
down
wechat
bug