IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i1d10.1057_palgrave.jors.2600659.html
   My bibliography  Save this article

Determination of lockbox collection points via simulated annealing

Author

Listed:
  • P R McMullen

    (University of Maine)

  • R A Strong

    (University of Maine)

Abstract

This research presents a heuristic to solve the lockbox location problem via a search-based technique known as simulated annealing. In the past, more traditional mathematical programming techniques have been used to address this problem, but with limited success due to its combinatorial nature. Because simulated annealing is a search-based technique, an optimal solution is not guaranteed, but past research has demonstrated that search-based heuristics can provide reasonable solutions without the difficulties associated with the more traditional formulations. In this paper, the simulated annealing methodology is used to solve a large lockbox location problem at several differing levels of cost. The results compare favourably to solutions obtained from a K-means clustering heuristic.

Suggested Citation

  • P R McMullen & R A Strong, 1999. "Determination of lockbox collection points via simulated annealing," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(1), pages 44-51, January.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:1:d:10.1057_palgrave.jors.2600659
    DOI: 10.1057/palgrave.jors.2600659
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600659
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600659?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.

    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:50:y:1999:i:1:d:10.1057_palgrave.jors.2600659. 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.