Results 71 to 80 of about 17,281 (197)
Time-Dependent Traveling Salesman Problem with Multiple Time Windows [PDF]
The TSP, VRP and OP problems with time constraints have one common sub-problem – the task of finding the minimum route duration for a given order of customers. While much work has been done on routing and scheduling problems with time windows, to this date only few articles considered problems with multiple time windows.
openaire +2 more sources
The team orienteering problem with variable time windows
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
Dynamic Island Model based on Spectral Clustering in Genetic Algorithm
How to maintain relative high diversity is important to avoid premature convergence in population-based optimization methods. Island model is widely considered as a major approach to achieve this because of its flexibility and high efficiency.
Ellisy, John +3 more
core +1 more source
OPTIMIZING MULTIPLE TRAVELLING SALESMAN PROBLEM CONSIDERING THE ROAD CAPACITY [PDF]
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
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
Maximum-entropy principle approach to the multiple travelling salesman problem and related problems [PDF]
This thesis presents an investigation into the applications of the maximum-entropy principle as a heuristic for the multiple travelling salesman problem.
Roehl, Brian
core
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
An evolutionary algorithm for online, resource constrained, multi-vehicle sensing mission planning
Mobile robotic platforms are an indispensable tool for various scientific and industrial applications. Robots are used to undertake missions whose execution is constrained by various factors, such as the allocated time or their remaining energy. Existing
Lane, David M., Tsiogkas, Nikolaos
core +1 more source
Bio‐Inspired Swarm Robotics Design for Mine Automation
Ants demonstrate tandem running for cooperative haulage, and honeybees use memory‐based routes between hive and flowers. These behaviours inspire autonomous haulage robots in open‐pit mines to achieve efficient scan‐plan‐retrieve ore transport, replacing small haulage robots with large mining trucks.
Joven Tan +2 more
wiley +1 more source
ABSTRACT This study examines how individuals accept and navigate paradoxical tensions within a sustainability context, using a multiple case study of five Italian companies implementing circularity measurement tools. By exploring the interplay between self‐efficacy and acceptance of paradoxical tensions, drawing upon the Goal Setting and Paradox ...
Alice Alosi +4 more
wiley +1 more source

