The cumulative capacitated vehicle routing problem: New formulations and iterated greedy algorithms
作者：
Highlights：
• Two models for the Cumulative Capacitated Vehicle Routing Problem are proposed.
• Two Iterated greedy algorithms are developed.
• The algorithms found new best known results for small instances.
• The algorithms found the best known results for medium size instances in less time.
• The algorithms found competitive results against the literature for large instances.
摘要
•Two models for the Cumulative Capacitated Vehicle Routing Problem are proposed.•Two Iterated greedy algorithms are developed.•The algorithms found new best known results for small instances.•The algorithms found the best known results for medium size instances in less time.•The algorithms found competitive results against the literature for large instances.
论文关键词：Vehicle routing,Integer programming,Metaheuristics,Latency,Cumulative costs
论文评审过程：Received 14 November 2017, Revised 9 July 2018, Accepted 10 July 2018, Available online 11 July 2018, Version of Record 20 July 2018.
论文官网地址：https://doi.org/10.1016/j.eswa.2018.07.025
