IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v130y2004i1p143-16110.1023-banor.0000032573.42609.3a.html
   My bibliography  Save this article

Amortized Random Backtracking

Author

Listed:
  • Olivier Lhomme

Abstract

Some nonsystematic search algorithms can deal with partial assignments of variables, and then can use constraint propagation techniques. Let us call them NSPA algorithms (Nonsystematic Search with Partial Assignments). For satisfiability or optimization problems, such NSPA algorithms scale a lot better than systematic algorithms. We show in this paper that naive NSPA algorithms have to pay a severe overhead due to the way they visit partial assignments. Amortizing the visits of partial assignments is an important feature which we introduce and analyze in this paper. We also propose a new NSPA algorithm that is amortized: it is called Amortized Random Backtracking, and performs a probabilistic exploration of the search space. It can be seen as an amortized version of iterative sampling and has given very good experimental results on a real life time tabling problem. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • Olivier Lhomme, 2004. "Amortized Random Backtracking," Annals of Operations Research, Springer, vol. 130(1), pages 143-161, August.
    • Handle: RePEc:spr:annopr:v:130:y:2004:i:1:p:143-161:10.1023/b:anor.0000032573.42609.3a
    DOI: 10.1023/B:ANOR.0000032573.42609.3a
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000032573.42609.3a
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000032573.42609.3a?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.

    More about this item

    Keywords

    nonsystematic search; amortization;

    Statistics

    Access and download statistics

    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:spr:annopr:v:130:y:2004:i:1:p:143-161:10.1023/b:anor.0000032573.42609.3a. 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.springer.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.