A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows

作者：Nagata Yuichi^*; Braysy Olli; Dullaert Wout

来源：Computers & Operations Research, 2010, 37(4): 724-737.

DOI：10.1016/j.cor.2009.06.022

• Vehicle routing
• Time windows
• Memetic algorithm
• Penalty function

In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function to eliminate violations of the time window constraint as well as the capacity constraint from offspring solutions generated by the EAX operator have proven essential to the heuristic's performance. Experimental results on Solomon's and Gehring and Homberger benchmarks demonstrate that our algorithm outperforms previous approaches and is able to improve 184 best-known solutions out of 356 instances.

• 出版日期2010-4