Results 81 to 90 of about 59,482 (207)
Systems Engineering, Volume 29, Issue 3, Page 387-405, May 2026.ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza +3 more
wiley +1 more source
Penentuan Rute Distribusi Teh Botol Menggunakan Metode Traveling Salesman Problem (Tsp) Untuk Minimasi Biaya Distribusi [PDF]
, 2014 PT. Sinar Sosro merupakan salah satu Perusahaan yang bergerak dalam produk minuman yang terletak di Jl. Cangkir KM 21 Driyorejo Gresik, ada pun macam-macam produknya seperti Teh Botol, Fruit Tea, Cuntry Choice, Tebs dll.
& Sumiati, Fahmi Fuadi Al Akbar
core
The traveling salesman problem, conformal invariance, and dense polymers
, 2004 We propose that the statistics of the optimal tour in the planar random Euclidean traveling salesman problem is conformally invariant on large scales. This is exhibited in power-law behavior of the probabilities for the tour to zigzag repeatedly between ...
Jacobsen, J. L., Read, N., Saleur, H.
core +3 more sources
The team orienteering problem with variable time windows
International Transactions in Operational Research, Volume 33, Issue 3, Page 1705-1732, May 2026.Abstract The orienteering problem is well‐established within the domain of operational research. This paper introduces the team orienteering problem with variable time windows (TOPVTW) as a new variant of the team orienteering problem with time windows. The distinguishing feature of the TOPVTW is the adaptive time windows, which evolve dynamically as a
Bibiana Granda, Begoña Vitoriano
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
, 2017 For the Asymmetric Traveling Salesman Problem (ATSP), it is known that the Dantzig-Fulkerson-Johnson (DFJ) polytope is contained in the Miller-Tucker-Zemlin (MTZ) polytope. The analytic proofs of this fact are quite long.
Velednitsky, Mark
core +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
Phase transition in the assignment problem for random matrices
, 2005 We report an analytic and numerical study of a phase transition in a P problem (the assignment problem) that separates two phases whose representatives are the simple matching problem (an easy P problem) and the traveling salesman problem (a NP-complete ...
Esteve, J. G., Falceto, F.
core +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
Parallel ACO with a Ring Neighborhood for Dynamic TSP
, 2012 The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed.
A.Sameh +9 more
core +1 more source