An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem

作者：Dayarian Iman^*; Crainic Teodor Gabriel; Gendreau Michel; Rei Walter

来源：Transportation Research Part E: Logistics and Transportation Review , 2016, 95: 95-123.

DOI：10.1016/j.tre.2016.09.004

• Multi-period vehicle routing problem with seasonal fluctuations
• Tactical planning
• Seasonal variation
• Adaptive large neighborhood search

This problem involves optimizing product collection and redistribution from production locations to a set of processing plants over a planning horizon. This horizon consists of several days, and the collection-redistribution is performed on a repeating daily basis. A single routing plan must be prepared for the whole horizon, taking into account the seasonal variations in the supply. We model the problem using a sequence of periods, each corresponding to a season. We propose an adaptive large-neighborhood search with several specifically designed operators and features. The results show the excellent performance of the algorithm in terms of solution quality and computational efficiency.

• 出版日期2016-11