Results 81 to 90 of about 4,258 (228)
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
The Symmetric Traveling Salesman Problem
CoRR, 2005 Let M be an nXn symetric matrix, n, even, T, an upper bound for T_OPT, an optimal tour, sigma_T, the smaller-valued perfect matching obtained from alternate edges of T expressed as a product of 2-cycles. Applying the modified Floyd-Warshall algorithm to (sigma_T)^-1M^-, we construct acceptable and 2-circuit cycles some sets of which may yield circuits ...
openaire +3 more sources
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
The 2-period balanced traveling salesman problem [PDF]
In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core
, 2016 The Steiner travelling salesman problem (STSP) is an important issue in intelligent transportation systems and has various practical applications, such as travelling and parcel delivery. In this study, we consider the STSP in real-world road maps, i.e.,
Zhu, Mingzhe +5 more
core +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
Optimizing Path of The Travelling Salesman Problem Through Modified Genetic Algorithms
NTU Journal of Pure SciencesThe Traveling Salesman Problem (TSP) stands as one of the earliest and most pervasive optimization challenges, aiming to streamline the salesman's travel route, ensuring efficiency and avoiding redundancy. With an extensive number of cities to visit and
Osama Hassani
doaj +1 more source
Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem
Complexity, 2018 In this study, we develop two Ant Colony Optimization (ACO) models as new metaheuristic models for solving the time-constrained Travelling Salesman Problem (TSP).
Tomoko Sakiyama, Ikuo Arizono
doaj +1 more source
A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem. [PDF]
Comput Intell Neurosci, 2021 Odili JB, Noraziah A, Zarina M.
europepmc +1 more source