A hybrid search method for the vehicle routing problem with time windows

详细信息    查看全文

• 作者：Humberto C¨¦sar Brand?o?de?Oliveira and Germano Crispim Vasconcelos
• 关键词：Vehicle routing problems ; Hybrid systems ; Optimization ; Simulated annealing
• 刊名：Annals of Operations Research
• 出版年：2010
• 出版时间：November 2010
• 年：2010
• 卷：180
• 期：1
• 页码：125-144
• 全文大小：773.0 KB

文摘

Vehicle Routing Problems have been extensively analyzed to reduce transportation costs. More particularly, the Vehicle Routing Problem with Time Windows (VRPTW) imposes the period of time of customer availability as a constraint, a common characteristic in real world situations. Using minimization of the total distance as the main objective to be fulfilled, this work implements an efficient algorithm which associates non-monotonic Simulated Annealing to Hill-Climbing and Random Restart. The algorithm is compared to the best results published in the literature for the 56 Solomon instances and it is shown how statistical methods can be used to boost the performance of the method.