The traveling salesman problem with delivery and backhauls

Authors:
Shoshana Anily;Gur Mosheiov
Affiliations:
Faculty of Management, Tel-Aviv University, P.O. Box 39010, Ramat Aviv, Tel Aviv 69978, Israel;School of Business Administration and the Statistics Department, The Hebrew University, Jerusalem, Israel
Venue:
Operations Research Letters
Year:
1994

Citing 2
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

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

A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem that we consider here deals with a single vehicle of a given capacity that needs to serve N customers: some of the customers require a delivery of stock from the warehouse, whereas others need to deliver stock from their location to the warehouse. The objective is to find a shortest feasible tour visiting all customers, emanating from and ending at the warehouse. We introduce an efficient (O(N^2)) heuristic for this problem. The heuristic improves the worst-case bound known in the literature from 2.5 to 2. However, its average performance is shown in our numerical study to be slightly worse than that of a previously published (O(N^3)) solution method.