paper-with-me

Papers

TSPDiffuser: Diffusion Models as Learned Samplers for Traveling Salesperson Path Planning Problems

2024-06-05 · Ryo Yonetani

This paper presents TSPDiffuser, a novel data-driven path planner for traveling salesperson path planning problems (TSPPPs) in environments rich with obstacles. Given a set of destinations within obstacle maps, our objective is to efficiently find the shortest possible collision-free path that visits all the destinations. In TSPDiffuser, we train a diffusion model on a large collection of TSPPP instances and their respective solutions to generate plausible paths for unseen problem instances. The model can then be employed as a learned sampler to construct a roadmap that contains potential solutions with a small number of nodes and edges. This approach enables efficient and accurate estimation of travel costs between destinations, effectively addressing the primary computational challenge in solving TSPPPs. Experimental evaluations with diverse synthetic and real-world indoor/outdoor environments demonstrate the effectiveness of TSPDiffuser over existing methods in terms of the trade-off between solution quality and computational time requirements.

📄 PDF Abstract BibTeX arXiv:2406.02858

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Travel 설명 없음
SET Dynamic Sparse Training method where weight mask is updated randomly periodically
Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions

2020-06-05 · Jakob Bossek, Aneta Neumann, Frank Neumann

The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) ad…

CSRX: A novel Crossover Operator for a Genetic Algorithm applied to the Traveling Salesperson Problem

2023-03-22 · Martin Uray, Stefan Wintersteller, Stefan Huber

In this paper, we revisit the application of Genetic Algorithm (GA) to the Traveling Salesperson Problem (TSP) and introduce a family of novel crossover operators that outperform the previous state of the art. The novel …

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

2020-02-04 · Jakob Bossek, Katrin Casel, Pascal Kerschke, Frank Neumann

Several important optimization problems in the area of vehicle routing can be seen as a variant of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the traveling thief problem (…

Improvements for mlrose applied to the Traveling Salesperson Problem

2021-09-29 · Stefan Wintersteller, Martin Uray, Michael Lehenauer, Stefan Huber

In this paper we discuss the application of Artificial Intelligence (AI) to the exemplary industrial use case of the two-dimensional commissioning problem in a high-bay storage, which essentially can be phrased as an ins…

Test-Time Augmentation for Traveling Salesperson Problem

2024-05-08 · Ryo Ishiyama, Takahiro Shirakawa, Seiichi Uchida, Shinnosuke Matsuo

We propose Test-Time Augmentation (TTA) as an effective technique for addressing combinatorial optimization problems, including the Traveling Salesperson Problem. In general, deep learning models possessing the property …

Combinatorial Optimization