Results 71 to 80 of about 8,730 (184)
A Contribution to the “Travelling-Salesman” Problem
Journal of the Royal Statistical Society Series B: Statistical Methodology, 1955 Summary This paper is concerned with finding the shortest closed path joining n points where the distances between all pairs of points are given. For a set of points in a metric space we establish that the shortest path will consist of a single loop circuit that will never cross itself.
Morton, G., Land, A. H.
openaire +2 more sources
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
Optimizing Movement Sequences for Step-and-Scan Lithography Equipment
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2013 The purpose of this work is to improve the throughput of step-and-scan lithography equipment to shorten the production time of a wafer. For this purpose, we propose a method for solving the MSOP (Movement Sequence Optimization Problem), which is the ...
Yuji SHINANO +3 more
doaj +1 more source
Navigating Knowledge: Effects of State Curiosity on Children's Word Learning and Information Seeking
Developmental Science, Volume 29, Issue 4, July 2026.ABSTRACT Early learning takes place within complex, multimodal environments where curiosity plays a critical role in guiding exploratory behaviors and supporting cognitive development. While trait curiosity shapes children's early learning experiences, state curiosity is context‐dependent fostering early learning, in‐part, through information seeking ...
Anna Caunt +3 more
wiley +1 more source
On One Implementation of a Natural Approach to Solving the Traveling Salesman Problem
Кібернетика та комп'ютерні технологіїIntroduction. The relevance of the traveling salesman problem is associated with the need to develop computational schemes for use in situations that require the analysis of information of a sufficiently large volume.
Dmitri Terzi
doaj +1 more source
Trajectory Stability in the Traveling Salesman Problem
Complexity, 2018 Two generalizations of the traveling salesman problem in which sites change their position in time are presented. The way the rank of different trajectory lengths changes in time is studied using the rank diversity.
Sergio Sánchez +5 more
doaj +1 more source
The Railway Traveling Salesman Problem [PDF]
, 2007 We consider theRailwayTraveling SalesmanProblem(RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP is an NP-hard problem.
Georgia Hadjicharalambous +4 more
openaire +1 more source
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP) [PDF]
Journal of Optimization in Industrial Engineering, 2010 Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution.
Ellips Masehian
doaj
On Labeled Traveling Salesman Problems [PDF]
, 2008 We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum (or minimum) number of colors. We derive results regarding hardness of approximation, and analyze approximation algorithms for both versions of the problem.
Basile Couëtoux +3 more
openaire +1 more source
THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS
Acta Polytechnica CTU Proceedings, 2016 In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM).
Petr Váňa, Jan Faigl
doaj +1 more source