IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i5p822-831.html
   My bibliography  Save this article

On parallel local search for permutations

Author

Listed:
  • Atle Riise

    (SINTEF ICT, Department of Applied Mathematics, University of Oslo, Oslo, Norway)

  • Edmund K Burke

    (University of Stirling, Stirling, UK)

Abstract

We investigate some ways in which massively parallel computing devices can be exploited in local search algorithms. We show that the substantial speedups that can be gained from parallel neighbourhood evaluation enables an efficient best improvement local search, and that this in turn enables further speedups through selection and parallel application of a set of independent, improving moves. Our experiments demonstrate a total speedup of up to several hundred times compared to a classical, sequential best improvement search. We also demonstrate how an exchange of good partial solutions between the incumbent and best found solutions improves the efficiency of the Iterated Local Search algorithm.

Suggested Citation

  • Atle Riise & Edmund K Burke, 2015. "On parallel local search for permutations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(5), pages 822-831, May.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:5:p:822-831
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n5/pdf/jors201429a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n5/full/jors201429a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Bäumelt, Zdeněk & Dvořák, Jan & Šůcha, Přemysl & Hanzálek, Zdeněk, 2016. "A novel approach for nurse rerostering based on a parallel algorithm," European Journal of Operational Research, Elsevier, vol. 251(2), pages 624-639.

    More about this item

    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:pal:jorsoc:v:66:y:2015:i:5:p:822-831. 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.