New optimization heuristics. The great deluge algorithm and the record- to-record travel (Q1208846): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcph.1993.1010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030910540 / rank | |||
Normal rank | |||
Latest revision as of 22:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New optimization heuristics. The great deluge algorithm and the record- to-record travel |
scientific article |
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
