Filters








13,994 Hits in 4.3 sec

Solution of a Large-Scale Traveling-Salesman Problem [chapter]

Vašek Chvátal, William Cook, George B. Dantzig, Delbert R. Fulkerson, Selmer M. Johnson
2009 50 Years of Integer Programming 1958-2008  
. ■ »i ♦ ^j • d ij exce P t 6 45 ■ ▼% ♦ »5 -( d 45 -v e^' Now determine the six values of i»^ by setting 5^ -0 corresponding to basic variables x^,: (3.7) 5 12 -o 2) -e 3^ -o 45ö 51 -e 13 • o. fro« which  ... 
doi:10.1007/978-3-540-68279-0_1 fatcat:facbxt2voffwvi4ig6wvnjx7ie

Solution of a Large-Scale Traveling-Salesman Problem

G. Dantzig, R. Fulkerson, S. Johnson
1954 Journal of the Operations Research Society of America  
Solution of a Large-Scale Traveling-Salesman Problem 9 Solution of a Large-Scale Traveling-Salesman Problem Solution of a Large-Scale Traveling-Salesman Problem Solution of a Large-Scale  ...  Traveling-Salesman Problem Solution of a Large-Scale Traveling-Salesman Problem Solution of a Large-Scale Traveling-Salesman Problem Solution of a Large-Scale Traveling-Salesman Problem  ... 
doi:10.1287/opre.2.4.393 fatcat:73wtz5giongbpfrawtcrhxnc5a

A NEW PRACTICAL SOLUTION FOR LARGE-SCALE TRAVELING SALESMAN PROBLEM
大規模巡回セールスマン問題の一解法

HIROSHI KUBO, NORIO OKINO
1976 Journal of the Operations Research Society of Japan  
In this paper we propose a new solution which can solve large scale problems covering morc than lOO cities in high speed computation .Irl experiments using a computer ( H工TAC 8800 a 亡 FI10KYO University  ...  , The solution for the traveling saiesman problem is of imp 〔 } rtance because of its many application in the fields of engineering .  ...  xノ AIgorithm for the Traveling Salesman Problem , Opns .  ... 
doi:10.15807/jorsj.19.272 fatcat:fckc5gapwrgell35ceuz5gezya

Page 407 of The Journal of the Operational Research Society Vol. 58, Issue 3 [page]

2007 The Journal of the Operational Research Society  
Solution of a large scale traveling salesman problem. Opns Res 2: 393-410. Golden BL and Stewart WR (1985). Empirical analysis of heuristics.  ...  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley: Chichester. Lin S (1965). Computer solutions of the traveling salesman problem.  ... 

Page 912 of The Journal of the Operational Research Society Vol. 54, Issue 8 [page]

2003 The Journal of the Operational Research Society  
A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans Math Software 21: 410-415. Ghiani G and Laporte G (2000).  ...  Exact solution of large scale, asymmetric traveling salesman problems. 4CM Trans Math Software 21: 395-409. Carpaneto G, Dell’ Amico M and Toth P (1995).  ... 

A Taxonomyof Intelligent Algorithms used for Solving Traveling Salesman Problem (TSP) in the Year 2019

Haroon Altarawneh
2021 Zenodo  
Travel salesman problem (TSP) considered as one of the most important complex optimization problem.  ...  In our research we reviewed related published articles in the year 2019(Scopus database), to find the state-of-art in Solving Travel Salesman Problem (TSP) by different intelligent algorithms.  ...  ., doi:10.1007/978-3-030-16660-1_107.[9] Hameed, Ibrahim A. "Multi-Objective Solution of Traveling Salesman Problem with Time."  ... 
doi:10.5281/zenodo.4785093 fatcat:s62cji4vvfdwdnrolrrbb75t5m

Parallel Computing Approach to Solve Travelling Salesman Problem

Harshala C., Vivek B.
2017 International Journal of Computer Applications  
Travelling Salesman Problem (TSP) is eminent in combinatorial optimization problem.  ...  The experimental result shows our algorithm is efficient, and solves the large scale TSP problem which cannot be solved by sequential branch and bound.  ...  The travelling salesman problem results in more than one solution, but the aim is to find the best possible solution for large scale TSP amongst all available solution spaces in a polynomial time and the  ... 
doi:10.5120/ijca2017912780 fatcat:yohnjqzk2ffgplusmvfshhdrzi

Page 426 of The Journal of the Operational Research Society Vol. 46, Issue 4 [page]

1995 The Journal of the Operational Research Society  
Lewis (1977) An analysis of several heuristics for the traveling salesman problem. SIAM J. Comp. 6, 563-581. S. Lin (1965) Computer solutions of the traveling salesman problem. Bell Syst. Tech.  ...  Papserc (1980) Solving large-scale symmetric traveling salesman problems to optimally. Mgmt Sci. 26, 495-509. E. Baas and N.  ... 

Page 4140 of Mathematical Reviews Vol. , Issue 89G [page]

1989 Mathematical Reviews  
The solution of the travelling salesman problems for subsets is glued together in an order determined by the solution of the travelling salesman problem for their aggregates.  ...  (Russian) [Algorithms and an interactive system for the solution of the traveling salesman problem of large dimension on the plane] Coo6uieHus no IIpuxnagHok Matematuke.  ... 

The TSP phase transition

Ian P. Gent, Toby Walsh
1996 Artificial Intelligence  
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.  ...  Hard instances of the traveling salesman problem are associated with this transition. Similar results are seen both with randomly generated problems and benchmark problems using geographical data.  ...  at the University of Strathclyde for donating a large number of CPU cycles to these experiments.  ... 
doi:10.1016/s0004-3702(96)00030-6 fatcat:26tkf6e4a5bunnbgs2gu46ynv4

Hamiltonian path and symmetric travelling salesman polytopes

Maurice Queyranne, Yaoguang Wang
1993 Mathematical programming  
We introduce a projective approach for studying symmetric travelling salesman polytopes (STSPs).  ...  The symmetric travelling salesman polytope STSP(V) (resp., Hamiltonian path polytope HP(V)) is the convex hull of incidence vectors of all Hamiltonian cycles (resp., paths) on the complete undirected graph  ...  STS polytopes and in solving large-scale STS problems.  ... 
doi:10.1007/bf01581260 fatcat:b2o6g7p6pfh3liagh5fcsglu3e

Opt Art [chapter]

Robert Bosch
2006 Lecture Notes in Computer Science  
of abstract geometric tiles (via integer programming and various heuristics), and continuous line drawings (via the "solution" of large-scale instances of the traveling salesman problem).  ...  Optimization deals with finding the best way to complete a task-creating a schedule for a tournament, matching professors with courses, constructing an itinerary for a traveling salesman.  ...  of abstract geometric tiles (via integer programming and various heuristics), and continuous line drawings (via the "solution" of large-scale instances of the traveling salesman problem).  ... 
doi:10.1007/11757375_1 fatcat:l3cjv5d3tjb65frodicrnnh5ra

An enhanced hybrid genetic algorithm for solving traveling salesman problem

Zeravan Arif Ali, Subhi Ahmed Rasheed, Nabeel No'man Ali
2020 Indonesian Journal of Electrical Engineering and Computer Science  
<span>Robust known the exceedingly famed NP-hard problem in combinatorial optimization is the Traveling Salesman Problem (TSP), promoting the skillful algorithms to get the solution of TSP have been the  ...  The genetic algorithm gives the best individual of population by enhancing both cross over and mutation operators while local search gives the best local solutions by testing all neighbor solution.  ...  A lot of algorithms and a various approach has been tested in order to solving the traveling salesman problem, some of them has a good performance and obtained a very well solutions, while others have  ... 
doi:10.11591/ijeecs.v18.i2.pp1035-1039 fatcat:gercwy6rsbgq3hs4fyd2tybyei

Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems [chapter]

Michael N. Rice, Vassilis J. Tsotras
2012 Lecture Notes in Computer Science  
The Generalized Traveling Salesman Path Problem (GT-SPP) involves finding the shortest path from a location s to a location t that passes through at least one location from each of a set of generalized  ...  Experimental analysis on the road network of North America demonstrates that we can optimally solve large-scale, practical GTSPP instances typically in a matter of seconds, depending on the overall number  ...  In this paper, we establish an algorithmic framework for efficiently solving such problem types on large-scale, real-world road networks.  ... 
doi:10.1007/978-3-642-30850-5_30 fatcat:yz7s3q2e4fgs5dzm234g5fyy64

Traveling Salesman Problem: A Case Study

Dr. Leena Jain, Mr. Amit Bhanot
2004 INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY  
In this paper assignment based integer linear formulation presented for solving traveling salesman problem. Unfortunately, the assignment model can lead to infeasible solutions.  ...  Then this linear problem solved by open source software.  ...  The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling salesman problem (TSP), where more than one salesman can be used in the solution [13] .Historically, researchers  ... 
doi:10.24297/ijct.v3i1c.2773 fatcat:vzi4464v6nbd3jpn62rmlc2elm
« Previous Showing results 1 — 15 out of 13,994 results