Expected hitting times for backtracking adaptive search

D. W. Bulger; D. Alexander; W. P. Baritompa; G. R. Wood; Z. B. Zabinsky

doi:10.1080/02331930410001699351

Expected hitting times for backtracking adaptive search

D. W. Bulger^*, D. Alexander, W. P. Baritompa, G. R. Wood, Z. B. Zabinsky

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

This article analyses a counting process associated with a stochastic process arising in global optimisation. Backtracking adaptive search (BAS) is a theoretical stochastic global optimisation algorithm modelling the temporary acceptance of solutions of lower quality. BAS generalises the pure adaptive search and hesitant adaptive search algorithms, whose full search duration distributions are known. This article gives the exact expected search duration for backtracking adaptive search.

Original language	English
Pages (from-to)	189-202
Number of pages	14
Journal	Optimization
Volume	53
Issue number	2
DOIs	https://doi.org/10.1080/02331930410001699351
Publication status	Published - Apr 2004

Access to Document

10.1080/02331930410001699351

Cite this

@article{5c6b0aa5cfbd48069517f85daa6b08f5,

title = "Expected hitting times for backtracking adaptive search",

abstract = "This article analyses a counting process associated with a stochastic process arising in global optimisation. Backtracking adaptive search (BAS) is a theoretical stochastic global optimisation algorithm modelling the temporary acceptance of solutions of lower quality. BAS generalises the pure adaptive search and hesitant adaptive search algorithms, whose full search duration distributions are known. This article gives the exact expected search duration for backtracking adaptive search.",

author = "Bulger, {D. W.} and D. Alexander and Baritompa, {W. P.} and Wood, {G. R.} and Zabinsky, {Z. B.}",

year = "2004",

month = apr,

doi = "10.1080/02331930410001699351",

language = "English",

volume = "53",

pages = "189--202",

journal = "Optimization",

issn = "0233-1934",

publisher = "Taylor & Francis",

number = "2",

}

TY - JOUR

T1 - Expected hitting times for backtracking adaptive search

AU - Bulger, D. W.

AU - Alexander, D.

AU - Baritompa, W. P.

AU - Wood, G. R.

AU - Zabinsky, Z. B.

PY - 2004/4

Y1 - 2004/4

N2 - This article analyses a counting process associated with a stochastic process arising in global optimisation. Backtracking adaptive search (BAS) is a theoretical stochastic global optimisation algorithm modelling the temporary acceptance of solutions of lower quality. BAS generalises the pure adaptive search and hesitant adaptive search algorithms, whose full search duration distributions are known. This article gives the exact expected search duration for backtracking adaptive search.

AB - This article analyses a counting process associated with a stochastic process arising in global optimisation. Backtracking adaptive search (BAS) is a theoretical stochastic global optimisation algorithm modelling the temporary acceptance of solutions of lower quality. BAS generalises the pure adaptive search and hesitant adaptive search algorithms, whose full search duration distributions are known. This article gives the exact expected search duration for backtracking adaptive search.

UR - http://www.scopus.com/inward/record.url?scp=2542541260&partnerID=8YFLogxK

U2 - 10.1080/02331930410001699351

DO - 10.1080/02331930410001699351

M3 - Article

AN - SCOPUS:2542541260

VL - 53

SP - 189

EP - 202

JO - Optimization

JF - Optimization

SN - 0233-1934

IS - 2

ER -

Expected hitting times for backtracking adaptive search

Abstract

Access to Document

Other files and links

Fingerprint

Cite this