A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem

详细信息    查看全文

• 作者：Luca Talarico^a ; ^{luca.talarico@uantwerpen.be} ; Johan Springael^a ; Kenneth Sö ; rensen^a ; Fabio Talarico^b
• 关键词：Vehicle routing ; Metaheuristic ; Risk management ; Logistics ; Cash-in-Transit
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：547-556
• 全文大小：1160 K
• 卷排序：78

文摘

A new metaheuristic named ACO-LNS is developed to increase security in the CIT sector. The ACO-LNS combines the ant colony optimization with a VND heuristic. The ACO-LNS uses an effective large neighbourhood search heuristic. A set of benchmark instances for the RCTVRP is proposed and made publicly available. The ACO-LNS outperforms the existing algorithms for the RCTVRP.