IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v1y2009i4p433-455.html
   My bibliography  Save this article

Solution techniques for a crane sequencing problem

Author

Listed:
  • Jin Shang
  • Alan R. McKendall

Abstract

In the areas of power plant maintenance, shipyard and warehouse management, resources (items) assigned to locations need to be relocated. It is essential to develop efficient techniques for relocating items to new locations using a crane such that the sum of the cost of moving the items and the cost of loading/unloading the items is minimised. This problem is defined as the crane sequencing problem (CSP). Since the CSP determines the routes for a crane to relocate items, it is closely related to some variants of the travelling salesman problem. However, the CSP considers the capacities of locations and intermediate drops (i.e. preemptions) during a multiple period planning horizon. In this article, a mathematical model and hybrid ant systems are developed for the CSP. Computational experiments were conducted to evaluate the performances of the proposed techniques, and results show that the proposed heuristics are effective.

Suggested Citation

  • Jin Shang & Alan R. McKendall, 2009. "Solution techniques for a crane sequencing problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 1(4), pages 433-455.
    • Handle: RePEc:ids:ijmore:v:1:y:2009:i:4:p:433-455
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=26276
    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.

    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:ids:ijmore:v:1:y:2009:i:4:p:433-455. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.