Research Portal

Parameter-less late acceptance hill-climbing

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Standard Standard

Parameter-less late acceptance hill-climbing. / Bazargani, Mosab; Lobo, Fernando G.
Proceedings of the Genetic and Evolutionary Computation Conference. New York, NY, USA: Association for Computing Machinery, 2017. p. 219–226 (GECCO '17).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

HarvardHarvard

Bazargani, M & Lobo, FG 2017, Parameter-less late acceptance hill-climbing. in Proceedings of the Genetic and Evolutionary Computation Conference. GECCO '17, Association for Computing Machinery, New York, NY, USA, pp. 219–226. https://doi.org/10.1145/3071178.3071225

APA

Bazargani, M., & Lobo, F. G. (2017). Parameter-less late acceptance hill-climbing. In Proceedings of the Genetic and Evolutionary Computation Conference (pp. 219–226). (GECCO '17). Association for Computing Machinery. https://doi.org/10.1145/3071178.3071225

CBE

Bazargani M, Lobo FG. 2017. Parameter-less late acceptance hill-climbing. In Proceedings of the Genetic and Evolutionary Computation Conference. New York, NY, USA: Association for Computing Machinery. pp. 219–226. (GECCO '17). https://doi.org/10.1145/3071178.3071225

MLA

Bazargani, Mosab and Fernando G. Lobo "Parameter-less late acceptance hill-climbing". Proceedings of the Genetic and Evolutionary Computation Conference. GECCO '17. New York, NY, USA: Association for Computing Machinery. 2017, 219–226. https://doi.org/10.1145/3071178.3071225

VancouverVancouver

Bazargani M, Lobo FG. Parameter-less late acceptance hill-climbing. In Proceedings of the Genetic and Evolutionary Computation Conference. New York, NY, USA: Association for Computing Machinery. 2017. p. 219–226. (GECCO '17). doi: 10.1145/3071178.3071225

Author

Bazargani, Mosab ; Lobo, Fernando G. / Parameter-less late acceptance hill-climbing. Proceedings of the Genetic and Evolutionary Computation Conference. New York, NY, USA : Association for Computing Machinery, 2017. pp. 219–226 (GECCO '17).

RIS

TY - GEN

T1 - Parameter-less late acceptance hill-climbing

AU - Bazargani, Mosab

AU - Lobo, Fernando G.

PY - 2017/7/1

Y1 - 2017/7/1

N2 - The Late Acceptance Hill-Climbing (LAHC) algorithm has been recently introduced by Burke and Bykov. It is a simple, general purpose, one-point search metaheuristic that has similarities with Simulated Annealing (SA) in the sense that worsening moves on a current solution can be accepted. One of its advantages relative to Simulated Annealing is that no cooling schedule is required and its sole parameter, the so-called history length, has a more meaningful interpretation from the application point of view and is therefore easier to specify by a user. In this paper we show that even this single parameter can be eliminated, making LAHC simpler to apply in practice. The validity of the method is shown with computational experiments on a number of instances of the Travelling Salesman Problem.

AB - The Late Acceptance Hill-Climbing (LAHC) algorithm has been recently introduced by Burke and Bykov. It is a simple, general purpose, one-point search metaheuristic that has similarities with Simulated Annealing (SA) in the sense that worsening moves on a current solution can be accepted. One of its advantages relative to Simulated Annealing is that no cooling schedule is required and its sole parameter, the so-called history length, has a more meaningful interpretation from the application point of view and is therefore easier to specify by a user. In this paper we show that even this single parameter can be eliminated, making LAHC simpler to apply in practice. The validity of the method is shown with computational experiments on a number of instances of the Travelling Salesman Problem.

KW - parameter-less search algorithms

KW - metaheuristics

KW - local search

KW - late acceptance hill-climbing

U2 - 10.1145/3071178.3071225

DO - 10.1145/3071178.3071225

M3 - Conference contribution

SN - 9781450349208

T3 - GECCO '17

SP - 219

EP - 226

BT - Proceedings of the Genetic and Evolutionary Computation Conference

PB - Association for Computing Machinery

CY - New York, NY, USA

ER -