Approximate algorithms for the travelling purchaser problem

Authors:
Hoon Liong Ong
Affiliations:
Department of Industrial & Systems Engineering, National University of Singapore, Kent Ridge, Singapore 0511
Venue:
Operations Research Letters
Year:
1982

Citing 1
Cited 4

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

The traveling purchaser problem with budget constraint

Computers and Operations Research
The multiple traveling purchaser problem for maximizing system's reliability with budget constraints

Expert Systems with Applications: An International Journal
Look-ahead heuristics for the dynamic traveling purchaser problem

Computers and Operations Research
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the generalized savings heuristics of Golden, Levy and Dahl and propose several new heuristic procedures for solving the travelling purchaser problem. A comparative study of the four heuristics considered is provided.