Results 71 to 80 of about 72,557 (222)
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
A matheuristic for the traveling salesman problem with positional consistency constraints
International Transactions in Operational Research, EarlyView.Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem [PDF]
, 2012 The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once.
Karapetyan, Daniel, Reihaneh, Mohammad
core +2 more sources
Quantum annealing of the Traveling Salesman Problem
, 2004 We propose a path-integral Monte Carlo quantum annealing scheme for the symmetric Traveling Salesman Problem, based on a highly constrained Ising-like representation, and we compare its performance against standard thermal Simulated Annealing.
D. J. Wales +4 more
core +1 more source
International Transactions in Operational Research, EarlyView.Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira +1 more
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
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
, 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
Evaluation of drone system for thinning operations–a case study in Sweden
International Transactions in Operational Research, EarlyView.Abstract Thinning operations in forestry typically involve a two‐machine system (TMS) with a harvester and a forwarder. Its productivity in different forest conditions is well documented. To date, drones have been used for data collection and surveillance but not as an alternative to a TMS.
Mikael Rönnqvist +3 more
wiley +1 more source
Quantum heuristic algorithm for traveling salesman problem
, 2012 We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they
A. M. Childs +31 more
core +1 more source