Results 31 to 40 of about 8,730 (184)
An Algorithm for the Traveling Salesman Problem [PDF]
Operations Research, 1963 A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by a procedure called branching. For each subset a lower bound on the length of the tours therein is calculated.
Little, J. D. C. +3 more
openaire +2 more sources
Spatial Transformation of Equality – Generalized Travelling Salesman Problem to Travelling Salesman Problem [PDF]
ISPRS International Journal of Geo-Information, 2018 The Equality-Generalized Travelling Salesman Problem (E-GTSP), which is an extension of the Travelling Salesman Problem (TSP), is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycle that visits each group exactly once.
Mohammed Zia +2 more
openaire +3 more sources
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
Solving MTSP with Two-stage SA and GA Based on Spark [PDF]
Zhengzhou Daxue xuebao. Gongxue banA two-stage KSAGA algorithm combining Spark-based simulated annealing and genetic algorithms was proposed for the single-depot multiple traveling salesman problem with minimum total path length. In the first stage, the multiple traveling salesman problem
SUN Jian, LIU Pin, LI Hao, CHEN Pan
doaj +1 more source
Advanced Electronic Materials, EarlyView.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
On the Solution of the Traveling Salesman Problem by a Modification of the Hungarian Method
Кібернетика та комп'ютерні технологіїIntroduction. The traveling salesman problem is becoming an important object of research in various fields of science, economics and technology. Construction of efficient algorithms with an optimality criterion for the obtained solution is a relevant ...
Dmitri Terzi
doaj +1 more source
OPTIMAL TOUR CONSTRUCTIONS FOR MULTIPLE MOBILE ROBOTS [PDF]
Journal of Engineering Science and Technology, 2011 The attempts to use mobile robots in a variety of environments are currently being limited by their navigational capability, thus a set of robots must be configured for one specific environment. The problem of navigating an environment is the fundamental
AMIR A. SHAFIE
doaj
A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems
International Journal of Computational Intelligence Systems, 2018 Multiple Traveling Salesman Problem (MTSP) is able to model and solve various real-life applications such as multiple scheduling, multiple vehicle routing and multiple path planning problems, etc.
Kin-Ming Lo +5 more
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study demonstrates how a profitable, lean, and environmentally responsible e‐waste reverse logistics system can be designed using integrated Operations Research (OR) techniques. Addressing the growing urgency of responsible consumption (UN SDG 12) and the projected rise of the e‐waste sector to USD 137.60 billion by 2029, the research ...
Sheeba Pathak, Hajar Fatorachian
wiley +1 more source
Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression
Journal of Applied Mathematics, 2014 This paper solves the dynamic traveling salesman problem (DTSP) using dynamic Gaussian Process Regression (DGPR) method. The problem of varying correlation tour is alleviated by the nonstationary covariance function interleaved with DGPR to generate a ...
Stephen M. Akandwanaho +2 more
doaj +1 more source