Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees

Kemal Altinkemer and Bezalel Gavish
Additional contact information
Kemal Altinkemer: Purdue University, West Lafayette, Indiana 47907
Bezalel Gavish: Vanderbilt University, Nashville, Tennessee 37203

Transportation Science, 1990, vol. 24, issue 4, 294-297

Abstract: In this paper Q Iterated Optimal Tour Partitioning, and Best Optimal Tour Partitioning algorithms are studied and analyzed for their worst case error. Both algorithms are based on partitioning an optimal traveling salesman tour in order to generate a feasible solution to the unit weight delivery problem. They have a worst case error bound of 2 − 1/ Q where Q is the maximal number of customers a vehicle could visit and N is the total number of customers. Similar worst case error bounds are shown when the algorithms are applied to an α-optimal traveling salesman tour.

Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.24.4.294 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:24:y:1990:i:4:p:294-297

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().