A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this study we explore the effect of choice of neighborhood size on the algorithm's performance when applied to the travelling salesman problem. ... Simulated annealing is a probabilistic algorithm that has shown some promise when applied to combinatorially NP-hard problems. ... ACKNOWLEDGM ENTS The authors wish to thank Mark Eggert for valuable programming support. ...doi:10.1080/01966324.1988.10737247 fatcat:ef4zfdxtpfhpbpwdfsuq2ifsme
Lecture Notes in Computer Science
The performance of dMSXF is tested on 1max problem and Traveling Salesman Problem, and its superiority to conventional methods, e.g. uniform crossover, is shown. ... However, MSXF works unsteadily according to the temperature parameter, like as Simulated Annealing. ... Even for the traveling salesman problem (TSP), a benchmark problem which has the simple definition and slight constraints, over ten years and ton of efforts were required to develop better crossovers generating ...doi:10.1007/3-540-45712-7_16 fatcat:wec2kznj2rf7fduwzl5qxcextm
The chapter also presents practical guidelines for the implementation of simulated annealing in terms of cooling schedules, neighborhood functions, and appropriate applications. ... Asymptotic convergence and finite-time performance theory for simulated annealing are reviewed. Other local search algorithms are discussed in terms of their relationship to simulated annealing. ... 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
Lecture Notes in Computer Science
For a special class of Traveling Salesman Problems a stochastic model of the optimization process is introduced. ... An analysis of the dynamic behavior of Evolution Strategies applied to Traveling Salesman Problems is presented. ... As a representative for NPcomplete optimization problems we chose the Traveling Salesman Problem (TSP). This is the problem of nding a tour with minimal length through n cities. ...doi:10.1007/bfb0014824 fatcat:bhkevzz6ebgi5agfgmtbo7bmzi
Trajectory methods are those that deal with a single solution. These include simulated annealing, tabu search, variable neighborhood search and greedy randomized adaptive search procedure. ... This paper aims to present a brief survey of different metaheuristic algorithms for solving the combinatorial optimization problems. ... In order to improve the performance simulated annealing is merged with a tabu search algorithm  . Huajin jang et al (2006) proposed a simulated annealing for solving traveling salesman problem. ...doi:10.5120/9391-3813 fatcat:7ur2f64xvvb6jc4ojsd5jujfeq
Keywords-Optimal path, traveller salesman problem, combined optimality criterion, simulated annealing algorythm. I. ... Applying combined criterion for solving traveler-salesman problem increases possibility of obtaining optimal solution for users with individual preferences. ... SIMULATED ANNEALING ALGORITHM AND TRAVELLER SALESMAN PROBLEM The Travelling salesman problem was first formulated in 1930 and is one of the most intensively studied problems in optimization. ...doi:10.17577/ijertv4is040228 fatcat:yened45v5bgs3nrpomvgyrbk64
In this paper, two smoothing effects are firstly pointed out by analysis and by experiment on Traveling Salesman Problem(TSP) instances. ... Basic idea of SSS The Smoothing Effect Smoothing for Traveling Salesman The Traveling Salesman Problem is one of the most well-known combinatorial optimization problems. ... In this paper, we provide a systemic discussion on the design of SSS based algorithm for Traveling Salesman Problem. ...doi:10.2991/jcis.2006.213 dblp:conf/jcis/DongGYWH06a fatcat:so55jfdtwzeuncfuruwcuczaou
For solving traveling salesman problem (TSP), the ant colony optimization (ACO) algorithm and simulated annealing (SA) algorithm are used to propose a two-phase hybrid optimization (TPASHO) algorithm in ... Finally, the probabilistic jumping property of the SA algorithm is used to effectively avoid falling into local optimal solution. ... The traveling salesman problem (TSP) is a well-known combinatorial optimization problem and NP-complete problem, which finds a route covering each city once and only once with a minimum route distance ...doi:10.14257/ijsh.2015.9.10.04 fatcat:vbwbhzj2sbfg7okvlpgzkxpnvm
The traveling salesman problem (TSP) is a classic problem in combinatorial optimization . An N-city asymmetric TSP has (N -1)! tours. ... We develop a conceptual mapping of an N-city problem to a two-dimensional space and computer code for the defining function and its inverse . ... INTRODUCTION The traveling salesman problem (TSP) is one of the most widely-studied problems in combinatorial optimization . ...doi:10.1016/0898-1221(93)90060-9 fatcat:oygidkwltzcyjh336excayimta
It was done by using the Traveling Salesman Problem with Hotel Selection or Base selections via a Simulated Annealing algorithm. ... The results show an improvement in a reasonable timeframe by using the Simulated Annealing. ... Therefore, for the current research, a variant for the TSP will be implemented, the Traveling Salesman Problem with Hotel Selection (TSPHS) with Simulated Annealing. ...doi:10.25046/aj050562 fatcat:ptbtihmh7jefplygun4aw7dc5y
a probabilistic acceptance criterion with a Simulated Annealing parameter K of 2. ... Script for traveling salesman problem. necessary for specifying the search strategy. ...doi:10.1057/palgrave.jors.2600479 fatcat:aauzpwhzija4fe3ookkgukdewu
a probabilistic acceptance criterion with a Simulated Annealing parameter K of 2. ... Script for traveling salesman problem. necessary for specifying the search strategy. ...doi:10.1038/sj.jors.2600479 fatcat:ecdvooryefdktjm5jprm4fx2de
Summary: “We analyze relationships among local minima for the traveling salesman and graph bisection problems under standard neighborhood structures. ... Gulyanitskii [“Solution of qua- dratic assignment problems by probabilistic simulation algorithms” (Russian), Preprint 91-45, IK AN UkrSSR, Kiev, 1991; per bibl.] accordingly differ from the annealing ...
The Journal of the Operational Research Society
Optimiza- tion by simulated annealing Science 220: 671-683. Cerny V (1985). Thermodynamical approach to the travelling salesman problem J Optim Theory Appl 45: 41-51. ... A note on the effect of neighborhood structure in simulated annealing Comp Opns Res 18: 537-547. Jacobs LW and Brusco MJ (1995). ...
Combining this discrete PSO algorithm with neighbors, the paper puts forward Hybrd Particle Swarm Optimization Algorithm, whose effectiveness is verified at the end of this paper. ... This paper first introduces the concepts of mobile operators and mobile sequence, with which it redefines the rate of particle swarm optimization algorithm and the formula of position updating. ... Marinaki, "A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem," Computers & Operations Research, Vol. 37, No. 3, 2010, pp. 432-442. doi:10.1016/ ...doi:10.4236/ica.2013.42017 fatcat:5gi5sppeobdglevuvybd7o3obm
« Previous Showing results 1 — 15 out of 897 results