نتایج جستجو برای: traveling salesman

تعداد نتایج: 17570  

2009
Paulo Henrique Siqueira Sérgio Scheer Maria Teresinha Arns Steiner

This paper presents a heuristic technique that uses the Wang Recurrent Neural Network with the "Winner Takes All" principle to solve the Traveling Salesman Problem. When the Wang Neural Network presents solutions for the Assignment Problem with all constraints satisfied, the "Winner Takes All" principle is applied to the values in the Neural Network’s decision variables, with the additional con...

Journal: :Artif. Intell. 1996
Ian P. Gent Toby Walsh

The traveling salesman problem is one of the most famous combinatorial problems. We identify a natural parameter for the two-dimensional Euclidean traveling salesman problem. We show that for random problems there is a rapid transition between soluble and insoluble instances of the decision problem at a critical value of this parameter. Hard instances of the traveling salesman problem are assoc...

2010
Douglas R. Hains Darrell Whitley Adele Howe Jennifer Mueller

OF THESIS GENERALIZED PARTITION CROSSOVER FOR THE TRAVELING SALESMAN

Journal: :Theoretical Computer Science 2016

Journal: :Computers & Mathematics with Applications 2012

Journal: :SIAM Journal on Discrete Mathematics 2016

2016
Hamid Tabatabaee

Traveling salesman problem is of the known and classical problems at Research in Operations. Many scientific activities can be solved as traveling salesman problem. Existing methods for solving hard problems (such as the traveling salesman problem) consists of a large number of variables and constraints which reduces their practical efficiency in solving problems with the original size. In rece...

2014
Jun Li Qirui Sun MengChu Zhou Xiaolong Yu Xianzhong Dai

Multiple Traveling Salesman Problem (MTSP) is an important combinatorial optimization problem. However, it is applicable to only the cases in which multiple executing individuals (traveling salesman) share the common workspace (city set). It cannot be used to handle many multi-machine engineering systems where multiple machines’ workspaces are not the same and partially overlap with each other....

Journal: :INFORMS Journal on Computing 2013
Manuel A. Alba Martínez Jean-François Cordeau Mauro Dell'Amico Manuel Iori

The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any of the deliveries. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-first-out policy. The problem consists in finding the shortest Hamiltonian cycles covering all pic...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید