Results 81 to 90 of about 28,986 (210)
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
Ain Shams Engineering JournalThe Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem and is also categorized as NP-hard problem. The Multiple Traveling Salesmen Problem (MTSP) represents a variant of TSP, which is more complex and holds greater practical
Lun Zhu, Yongquan Zhou, Qifang Luo
doaj +1 more source
On the Core of Multiple Longest Traveling Salesman Games [PDF]
In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward ...
Borm, P.E.M. +2 more
core +1 more source
Heuristics for the traveling repairman problem with profits [PDF]
, 2010 In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue.
Dewilde, Thijs +4 more
core +1 more source
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
Decision Science Letters, 2015 This paper considers a multi-objective version of the Multiple Traveling Salesman Problem (MOmTSP). In particular, two objectives are considered: the minimization of the total traveled distance and the balance of the working times of the traveling ...
Rubén Iván Bolaños +2 more
doaj +1 more source
Advanced Functional Materials, Volume 36, Issue 34, 27 April 2026.A stacked memristor crossbar architecture is presented that enables direct in‐memory computation of Euclidean distance through intrinsic current subtraction at a shared middle electrode. By physically encoding weights and squared weights in vertically aligned layers, the system realizes energy‐efficient self‐organizing map learning, demonstrating ...
Jinwoo Park, Hyungjin Kim
wiley +1 more source
OPTIMIZING MULTIPLE TRAVELLING SALESMAN PROBLEM CONSIDERING THE ROAD CAPACITY [PDF]
Journal of Computer Science, 2014 The Multiple Travelling Salesman Problems (MTSP) can be used in a wide range of discrete optimization problems. As the solution to this prob lem has wide applicability in many practical fields , this NP Hard problem highly raises the need for an efficient solution. The problem is determining a se t of routes for the salesmen that jointly visit a set of
openaire +1 more source
Advanced Intelligent Systems, Volume 8, Issue 4, April 2026.Large‐scale Hopfield neural networks (HNNs) for associative computing are implemented using vertical NAND (VNAND) flash memory. The proposed VNAND HNN with the asynchronous update scenario achieve robust image restoration performance despite fabrication variations, while significantly reducing chip area (≈117× smaller than resistive random‐access ...
Jin Ho Chang +4 more
wiley +1 more source
Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem
, 2018 We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather wide in real-world problems.
Kovalenko, Yulia V. +1 more
core +1 more source