New optimization heuristics. The great deluge algorithm and the record- to-record travel (Q1208846)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 167053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New optimization heuristics. The great deluge algorithm and the record- to-record travel |
scientific article; zbMATH DE number 167053 |
Statements
New optimization heuristics. The great deluge algorithm and the record- to-record travel (English)
0 references
16 May 1993
0 references
New heuristic optimization algorithms, the great deluge algorithm and the record-to-record travel algorithm, are presented and applied to the 442- cities problem of \textit{M. Grötschel} [Preprint No. 38, Univ. Augsburg (1984)] and the 532-cities problem of \textit{M. Padberg} and \textit{G. Rinaldi} [Oper. Res. Lett. 6, 1-7 (1987; Zbl 0618.90082)]. Computational results are given.
0 references
threshold accepting
0 references
simulated annealing
0 references
discrete optimization
0 references
great deluge algorithm
0 references
record-to-record travel
0 references
0.7584909200668335
0 references
0.7563870549201965
0 references
0.7526347637176514
0 references
0.7521833181381226
0 references
0.7474539875984192
0 references
