A generalized crossing local search method for solving vehicle routing problems

A generalized crossing local search method for solving vehicle routing problems

0.00 Avg rating0 Votes
Article ID: iaor20081290
Country: United Kingdom
Volume: 58
Issue: 4
Start Page Number: 528
End Page Number: 532
Publication Date: Apr 2007
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: heuristics: local search, optimization: simulated annealing
Abstract:

In this paper, we propose a generalized crossing local search method for solving vehicle routing problems. This method is a generalization of the string crossing method described in the literature. To evaluate the performance of the proposed method, extensive computational experiments on the proposed method applied to a set of benchmark problems are carried out. The results show that the proposed method, when coupled with metaheuristics such as simulated annealing, is comparable with other efficient heuristic methods proposed in the literature.

Reviews

Required fields are marked *. Your email address will not be published.