The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The authors give an approximation to the solution of the traveling | salesman problem by using C-optimal (optimal in mean) cycles, The use of such cycles allows one to treat the traveling salesman problem ... and policy iteration techniques for solving large scaled problems. ...
In this paper, we propose a Simulated Annealing PolyClonal Selection Algorithm (SAPCSA) for Traveling Salesman Problems (TSP). ... By introducing a simulated annealing (SA) strategy to the PolyClonal Selection Algorithm (PCSA), the SAPCSA integrate the characteristics of both SA and PCSA. ... avoid premature convergence and can find a better solution for the traveling salesman problems. ...doi:10.1093/ietfec/e90-a.12.2930 fatcat:rq6iavduajcxfnd43ozyu5n6vi
The result shows that the compressed annealing algorithm is a comparatively better method to solve multi-time window traveling salesman problem. ... This paper applies the multi-time window traveling salesman problem to not only optimize the logistics cost, but also effectively endow users with multiple discrete idle optional time periods to meet the ... The Traveling Salesman Problem with multiple time windows studied is an extension of the single time-window Traveling Salesman problem. ...doi:10.1051/itmconf/20224501017 fatcat:eb6sht4konfglpzq3esxub2tia
With applications to many disciplines, the traveling salesman problem (TSP) is a classical computer science optimization problem with applications to industrial engineering, theoretical computer science ... Genetic algorithm has the best performance for optimality for medium to large datasets, but generally have longer runtime. Our implementations is public available. ... For example, the Large Step Markov Chain  relies on Markov chains to find convergence of many paths to form a global optimum and several papers cite Markov Chains as the best known solution to TSP ...arXiv:1705.09058v1 fatcat:47gatwr435elhdsrgmprhkt3re
We have tested this on the Euclidean Traveling Salesman Problem, improving 3-opt by over 1.6% and Lin-Kernighan by 1.3%. ... I Introduction Given N cities labeled by i = 1, N , separated by distances d i j , the Traveling Salesman Problem (TSP) consists in finding the shortest tour, i.e., the shortest ... Acknowledgements We thank David Johnson and Bill Cook for sharing their results with us and for discussions. ...doi:10.1016/0167-6377(92)90028-2 fatcat:3gqgdwjkqvhlnir7zgpfbzpm2e
of the traveling salesman problem. ... Compared to the approaches PT and parallel SA with the same temperature ladder, transition step sizes, and cooling scheme (parallel SA) configurations, our preliminary results obtained with the hybrid ... Li, and LDRD Program of the Oak Ridge National Laboratory managed by UT-Battelle, LLC, under contract DE-AC05-00OR22725, to A. Gorin. ...doi:10.1016/j.amc.2009.02.023 fatcat:m4uculxuu5chbegcushwyvivhu
The traveling salesman problem is a classic NP-hard combinatorial optimization problem which is important in operations research and theoretical computer science. ... It is not feasible to use the conventional particle swarm optimization and simulated annealing algorithm to find the optimal solution in such a large search space. ... It is more appropriate for traveling salesman problem than some classical mathematical methods. ...doi:10.12783/dtcse/iece2018/26649 fatcat:32gjsdygd5gcveuw66fqzwex7a
In this paper we give a new proof of the convergence of Simulated Annealing by applying results about rapidly mixing Markov chains. ... Simulated Annealing has proven to be a very sucessful heuristic for various combinatorial optimization problems. ... Acknowledgements The authors are grateful to the anonymous referees for their helpful comments and suggestions. ...doi:10.1287/moor.25.3.476.12211 fatcat:tfvyrr6oqnbbbhxn7adhiwmywu
The chapter also presents practical guidelines for the implementation of simulated annealing in terms of cooling schedules, neighborhood functions, and appropriate applications. ... It is typically used to address discrete and, to a lesser extent, continuous optimization problems. ... Acknowledgments This work is supported in part by the Air Force Office of Scientific Research (FA9550-07-1-0232). The authors wish to thank the anonymous referees for their feedback on this chapter. ...doi:10.1007/978-1-4419-1665-5_1 fatcat:idntn7ghpnc6div67wrwchizru
For the traveling salesman problem with randomly distributed cities in a square, the procedure improves on 3-opt by 1.6%, and on Lin-Kernighan local search by 1.3%. ... We have tested this meta-heuristic for the traveling salesman and graph partitioning problems. Tests on instances from public libraries and random ensembles quantify the power of the method. ... Finally, we acknowledge signi cant help from the PVM group at OGI for the implementation of the parallelization. ...doi:10.1007/bf02601639 fatcat:mtlpomzmfrehppka5ghzwho5hm
Monte Carlo and Quasi-Monte Carlo Methods 2006
Given an order on the state space, both approaches can be improved by sorting the ensemble of Markov chains. ... Then we discuss the efficiency of different sorting strategies for the example of light transport simulation. ... Acknowledgments The authors would like to thank mental images GmbH for support and for funding of this research. Jan Rzehak created the illustration in Figure 3 . ...doi:10.1007/978-3-540-74496-2_41 fatcat:ggc7uyrajnawff6wadcqwkxadi
The starting point came in 1959 when Beardwood, Halton and Hammersley obtained a strong law of large numbers for the optimum total cost of the traveling salesman problem on such a random set of points. ... For each such Markov chain, the shape at each step is defined to be that of one of the “daughters” obtained by splitting into two the rectangle that determined the shape at the previous step. ...
Genetic algorithms are useful for NP-hard problems, especially the traveling salesman problem. ... The traveling salesman problem (TSP), a typical non-deterministic polynomial (NP) hard problem, has been used in many engineering applications. ... Common traveling salesman problems include symmetric traveling salesman problem, asymmetric traveling salesman problem, multiperson traveling salesman problem, and multitarget traveling salesman problem ...doi:10.1155/2021/6697598 fatcat:zccdwyukw5h35hyqy4wvexytcu
It is also shown that if n is sufficiently large then any optimal policy for the finite stage problem is optimal for the corresponding infinite horizon problem as well. ... Given a graph on n vertices with costs associated to each edge, in the traveling salesman problem one seeks a circuit through all the vertices (i.e., a tour) of minimum total cost. ...
Travelling salesman problem (TSP) is a classical and most widely studied problem in both operation research and computer science. ... We propose a new algorithm to solve the fuzzy TSP and also implemented the same and the results are discussed. ... There are different approaches for solving travelling salesman problems. ...doi:10.5120/12942-9921 fatcat:rbhxat7njfbobm245lckpxkveu
« Previous Showing results 1 — 15 out of 1,394 results