Results 61 to 70 of about 5,666,790 (163)
Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover [PDF]
, 2012 Recent studies on a computationally hard visual optimization problem, the Traveling Salesperson Problem (TSP), indicate that humans are capable of finding close to optimal solutions in near-linear time.
Masson, Michael E. J. +2 more
core +1 more source
A New Evolutionary Multiobjective Model for Traveling Salesman Problem
IEEE Access, 2019 The traveling salesman problem (TSP) is one of the most classical NP-hard problems in the combinatorial optimization, as many practical problems, such as scheduling problems and vehicle-routing cost allocation problems can be abstracted. The introduction
Xuejiao Chen +5 more
doaj +1 more source
Production routing decisions in a two‐echelon supply chain with multiple delivery modes
International Transactions in Operational Research, Volume 33, Issue 5, Page 3385-3421, September 2026.Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel +2 more
wiley +1 more source
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP [PDF]
, 2013 2-Opt is probably the most basic local search heuristic for the TSP. This heuristic achieves amazingly good results on “real world” Euclidean instances both with respect to running time and approximation ratio.
Matthias Englert +5 more
core +1 more source
Transactions in GIS, Volume 30, Issue 6, September 2026.ABSTRACT Urban curbside monitoring requires routes that balance travel efficiency with representative sensing coverage. This study develops a reproducible GIS‐based routing framework for vehicle‐based residential curbside scanning. The framework integrates local‐residential target link identification, deterministic farthest point sampling, directed ...
Lubna Obaid +3 more
wiley +1 more source
TSP--Infrastructure for the Traveling Salesperson Problem [PDF]
The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city ...
Kurt Hornik, Michael Hahsler
core
Ordered Median Traveling Salesman Problem
Networks, Volume 88, Issue 1, Page 59-84, July 2026.ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić +3 more
wiley +1 more source
How to make a greedy heuristic for the asymmetric traveling salesman problem competitive [PDF]
It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP.
Jäger, G., Goldengorin, B.
core
New Heuristic Approaches for the Min–Max Regret Traveling Salesman Problem
IEEE AccessThe traveling salesman problem (TSP) is widely known as one of the most important NP-hard combinatorial optimization problems. In this paper, we consider the min-max regret traveling salesman problem (MMR-TSP) with interval travel costs. The MMR-TSP aims
Kazuki Hasegawa +2 more
doaj +1 more source
Didactic Visualization of Routing Problems
Education Sciences, 2020 The Traveling Salesman and Vehicle Routing Problems are integral parts of bachelor and master programs related to Operations Research/Management Science. This is due to their relevance in both practical applications and research.
Margaretha Gansterer, Veronika Klug
doaj +1 more source