Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 31, Issue 1, Pages 139-150Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0548(02)00193-4
Keywords
network optimization; heuristics; traveling purchaser
Ask authors/readers for more resources
For the Traveling Purchaser Problem we describe improvement subprocedures that can be incorporated in known heuristics. Computational results show the effectiveness of these subprocedures in general savings, commodity adding and tour reduction heuristics for test instances up to size 200 and four different cost types, including both symmetric and non symmetric costs as well as coordinate based costs. The average improvement of the solutions is substantial, i.e., from three to more than seven times smaller gaps for the best heuristic, based on savings.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available