IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i6d10.1057_palgrave_jors_2601342.html
   My bibliography  Save this article

Markov chain modelling of the solution surface in local search

Author

Listed:
  • E J Anderson

    (University of New South Wales)

Abstract

When local search methods are applied to combinatorial optimisation problems it is the characteristics of the solution surface that determine the effectiveness of the method. This paper aims to advance our understanding of solution surface characteristics. The focus is on the basin of attraction associated with each local minimum; that is the set of solutions from which a particular local minimum is reached by following downhill local search. A Markov chain model is proposed for the behaviour of the function values occurring in a random walk on the solution surface. The probability transition matrix can be estimated and this is used to estimate both the shape and the size of the basins of attraction. In order to test this approach a study is made of the problem of minimising weighted flowtime on unrelated parallel machines.

Suggested Citation

  • E J Anderson, 2002. "Markov chain modelling of the solution surface in local search," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(6), pages 630-636, June.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave_jors_2601342
    DOI: 10.1057/palgrave/jors/2601342
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave/jors/2601342
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave/jors/2601342?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. C-H Lan & C-Y Hsui & L-C Wei, 2005. "A complexity perspective to deploy artistic exhibits," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1151-1158, October.
    2. Mihael Baketarić & Marjan Mernik & Tomaž Kosar, 2021. "Attraction Basins in Metaheuristics: A Systematic Mapping Study," Mathematics, MDPI, vol. 9(23), pages 1-25, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave_jors_2601342. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.