Approximability of the Multiple Stack TSP
Sophie Toulouse (LIPN)
TL;DR
This paper investigates the approximability of the Multiple Stack TSP, establishing APX-hardness for certain variants and proposing heuristics with specific approximation ratios for others.
Contribution
It proves APX-hardness for asymmetric MaxSTSP and MinSTSP12, and introduces heuristics with proven approximation ratios for Max2STSP, Max2STSP12, and Min2STSP12.
Findings
Asymmetric MaxSTSP and MinSTSP12 are APX-hard.
Proposed heuristics achieve 1/2, 3/4, and 3/2 approximation ratios.
The paper advances understanding of the approximability landscape for Multiple Stack TSP variants.
Abstract
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notably establish that asymmetric MaxSTSP and MinSTSP12 are APX, and propose a heuristic that yields to a 1/2, 3/4 and 3/2 standard approximation for respectively Max2STSP, Max2STSP12 and Min2STSP12.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Packing Problems · Vehicle Routing Optimization Methods · Advanced Manufacturing and Logistics Optimization