forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tsp_brute.html
232 lines (199 loc) · 5.8 KB
/
tsp_brute.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
<html>
<head>
<title>
TSP_BRUTE - Brute Force Solution of Traveling Salesman Problem
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
TSP_BRUTE <br> Brute Force Solution of Traveling Salesman Problem
</h1>
<hr>
<p>
<b>TSP_BRUTE</b>
is a C++ program which
solves small versions of the traveling salesman problem, using
brute force.
</p>
<p>
The user must prepare a file beforehand, containing the city-to-city
distances. The program will request the name of this file, and then
read it in. An example of such a file is:
<pre>
0 3 4 2 7
3 0 4 6 3
4 4 0 5 8
2 6 5 0 6
7 3 8 6 0
</pre>
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this
web page are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>TSP_BRUTE</b> is available in
<a href = "../../c_src/tsp_brute/tsp_brute.html">a C version</a> and
<a href = "../../cpp_src/tsp_brute/tsp_brute.html">a C++ version</a> and
<a href = "../../f77_src/tsp_brute/tsp_brute.html">a FORTRAN77 version</a> and
<a href = "../../f_src/tsp_brute/tsp_brute.html">a FORTRAN90 version</a> and
<a href = "../../m_src/tsp_brute/tsp_brute.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/change_making/change_making.html">
CHANGE_MAKING</a>,
a C++ library which
considers the change making problem,
in which a given sum is to be formed using coins of various denominations.
</p>
<p>
<a href = "../../cpp_src/combination_lock/combination_lock.html">
COMBINATION_LOCK</a>,
a C++ program which
simulates the process of determining the secret combination of a lock.
</p>
<p>
<a href = "../../cpp_src/knapsack_01/knapsack_01.html">
KNAPSACK_01</a>,
a C++ library which
uses brute force to solve small versions of the 0/1 knapsack problem;
</p>
<p>
<a href = "../../cpp_src/partition_problem/partition_problem.html">
PARTITION_PROBLEM</a>,
a C++ library which
seeks solutions of the partition problem, splitting a set of integers into
two subsets with equal sum.
</p>
<p>
<a href = "../../cpp_src/satisfy/satisfy.html">
SATISFY</a>,
a C++ program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfiability problem.
</p>
<p>
<a href = "../../cpp_src/subset_sum/subset_sum.html">
SUBSET_SUM</a>,
a C++ library which
seeks solutions of the subset sum problem.
</p>
<p>
<a href = "../../datasets/tsp/tsp.html">
TSP</a>,
a dataset directory which
contains test data for the traveling salesperson problem;
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Gerhard Reinelt,<br>
TSPLIB - A Traveling Salesman Problem Library,<br>
ORSA Journal on Computing,<br>
Volume 3, Number 4, Fall 1991, pages 376-384.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "tsp_brute.cpp">tsp_brute.cpp</a>, the source code.
</li>
<li>
<a href = "tsp_brute.sh">tsp_brute.sh</a>,
BASH commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "tsp_5.txt">tsp_5.txt</a>,
an example of a 5x5 city-to-city distance matrix.
</li>
<li>
<a href = "tsp_5_output.txt">tsp_5_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for TSP_BRUTE.
</li>
<li>
<b>CH_CAP</b> capitalizes a single character.
</li>
<li>
<b>CH_EQI</b> is a case insensitive comparison of two characters for equality.
</li>
<li>
<b>CH_TO_DIGIT</b> returns the integer value of a base 10 digit.
</li>
<li>
<b>FILE_COLUMN_COUNT</b> counts the number of columns in the first line of a file.
</li>
<li>
<b>FILE_ROW_COUNT</b> counts the number of row records in a file.
</li>
<li>
<b>PERM_NEXT3</b> computes all of the permutations of N objects, one at a time.
</li>
<li>
<b>R8_HUGE</b> returns a very large R8.
</li>
<li>
<b>R8MAT_DATA_READ</b> reads data from an R8MAT file.
</li>
<li>
<b>R8MAT_HEADER_READ</b> reads the header from an R8MAT file.
</li>
<li>
<b>S_TO_R8</b> reads an R8 from a string.
</li>
<li>
<b>S_TO_R8VEC</b> reads an R8VEC from a string.
</li>
<li>
<b>S_WORD_COUNT</b> counts the number of "words" in a string.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 04 December 2013.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>