Results 31 to 40 of about 166,209 (267)
Modeling of transportation logistics processes for the urban environment [PDF]
E3S Web of Conferences, 2019 The article deals with the approach to modeling the road transport movement in large cities (with a population of over 100 thousand people) for the delivery of goods from a large warehouse to stores belonging to a trading network company, with the task ...
Romanov Petr, Romanova Irina
doaj +1 more source
The Traveling Salesman Problem Under Squared Euclidean Distances [PDF]
, 2010 Let $P$ be a set of points in $\mathbb{R}^d$, and let $\alpha \ge 1$ be a real number. We define the distance between two points $p,q\in P$ as $|pq|^{\alpha}$, where $|pq|$ denotes the standard Euclidean distance between $p$ and $q$.
de Berg, Mark +4 more
core +5 more sources
A Variable Neighborhood Search for Flying Sidekick Traveling Salesman Problem [PDF]
International Transactions in Operational Research, 2018 The efficiency and dynamism of Unmanned Aerial Vehicles (UAVs), or drones, present substantial application opportunities in several industries in the last years.
J. C. Freitas, P. Penna
semanticscholar +1 more source
Approximating ATSP by Relaxing Connectivity
, 2015 The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments
Svensson, Ola
core +1 more source
The Traveling Salesman Problem in the Natural Environment [PDF]
, 2010 Is it possible for humans to navigate in the natural environment wherein the path taken between various destinations is 'optimal' in some way? In the domain of optimization this challenge is traditionally framed as the "Traveling Salesman ...
Flip Phillips +2 more
core +2 more sources
A hybrid genetic algorithm for the traveling salesman problem with drone [PDF]
Journal of Heuristics, 2018 This paper addresses the traveling salesman problem with drone (TSP-D), in which a truck and drone are used to deliver parcels to customers. The objective of this problem is to either minimize the total operational cost (min-cost TSP-D) or minimize the ...
Quang Minh Ha +3 more
semanticscholar +1 more source
Traveling Salesman Problem with Transportation [PDF]
Computer Science Journal of Moldova, 2006 Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem.
Valeriu Ungureanu
doaj
Designing Memristive Materials for Artificial Dynamic Intelligence
Advanced Intelligent Discovery, EarlyView.Key characteristics required of memristors for realizing next‐generation computing, along with modeling approaches employed to analyze their underlying mechanisms. These modeling techniques span from the atomic scale to the array scale and cover temporal scales ranging from picoseconds to microseconds. Hardware architectures inspired by neural networks
Youngmin Kim, Ho Won Jang
wiley +1 more source
Advanced Intelligent Systems, EarlyView.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
Traveling Salesman Problem [PDF]
, 2015 Práce se zaměřuje na úpravu známých postupů ACO a GA s ohledem na zvyšování efektivity nalézaných řešení. Jsou zde prezentovány dva nové přístupy pro řešení TSP. Pomocí jednoho z nich lze také vytvořit počáteční populaci pro GA. Je uveden konkrétní návrh
Šůstek, Martin
core