Search
Search Results
-
-
Optimal TSP tour length estimation using Sammon maps
The optimal tour length of a non-Euclidean traveling salesman problem (TSP) can be estimated using the locations of vertices and the circuity factor....
-
The simultaneous semi-random model for TSP
Worst-case analysis is a performance measure that is often too pessimistic to indicate which algorithms we should use in practice. A classical...
-
On the generation of metric TSP instances with a large integrality gap by branch-and-cut
This paper introduces a computational method for generating metric Travelling Salesman Problem (TSP) instances having a large integrality gap. The...
-
Unsupervised Training for Neural TSP Solver
There has been a growing number of machine learning methods for approximately solving the travelling salesman problem. However, these methods often...
-
Predicting the Empirical Hardness of Metric TSP Instances
In this work, we propose to classify the empirical hardnesshardness of metric Travelling Salesman Problem (TSP) instances by using four features that...
-
-
Pseudogeometric Version of the Traveling Salesman Problem, Its Application in Quantum Physics Models and Some Heuristic Algorithms for Its Solution
The geometric version of the traveling salesman problem (TSP) has been extensively studied, leading to the development of various approaches for...
-
Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning
Branch-and-Cut is a widely-used method for solving integer programming problems exactly. In recent years, researchers have been exploring ways to use...
-
Hard to solve instances of the Euclidean Traveling Salesman Problem
The well known 4/3 conjecture states that the integrality ratio of the subtour LP is at most 4/3 for metric Traveling Salesman instances. We present...
-
HiTSP: Towards a Hierarchical Neural Framework for Large-scale Traveling Salesman Problems
Recently, learned heuristics have been widely applied to solve combinatorial optimization problems (e.g., traveling salesman problem (TSP)). However,...
-
-
Analysis of the Attractor-Based Search System
This chapter analyzes the search behavior of the ABSS in detail to answer three fundamental questions for the ABSS: (1) how can we construct the edge...
-
The Multi-visits Drone-Vehicle Routing Problem with Simultaneous Pickup and Delivery Service
The development of convergent technology makes the drone expected to become a commercial delivery method for terminal logistics distribution....
-
Approximation Ineffectiveness of a Tour-Untangling Heuristic
We analyze a tour-uncrossing heuristic for the Euclidean Travelling Salesperson Problem, showing that its worst-case approximation ratio is...
-
A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
In this paper, we consider differential approximability of the traveling salesman problem (TSP). The differential approximation ratio was proposed by...
-
Learning to Solve a Stochastic Orienteering Problem with Time Windows
Reinforcement learning (RL) has seen increasing success at solving a variety of combinatorial optimization problems. These techniques have generally...
-
NeuroPrim: An attention-based model for solving NP-hard spanning tree problems
Spanning tree problems with specialized constraints can be difficult to solve in real-world scenarios, often requiring intricate algorithmic design...
-
Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension
The maximum traveling salesman problem (Max TSP) consists of finding a Hamiltonian cycle with the maximum total weight of the edges in a given...
