A repeated matching heuristic for the vehicle routeing problem

A repeated matching heuristic for the vehicle routeing problem

0.00 Avg rating0 Votes
Article ID: iaor19951348
Country: United Kingdom
Volume: 45
Issue: 10
Start Page Number: 1156
End Page Number: 1167
Publication Date: Oct 1994
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: heuristics
Abstract:

A new heuristic for the vehicle routeing problem which makes use of repeated matching is described. The numerical results are comparable to or better than the best published for most of the 14 benchmark problems commonly used to evaluate VRP heuristics.

Reviews

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