Solution techniques for a crane sequencing problem

Jin Shang and Alan R. McKendall

International Journal of Mathematics in Operational Research, 2009, vol. 1, issue 4, 433-455

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.

Keywords: crane sequencing problem; CSP; hybrid ant systems; integer programming; metaheuristics; simulated annealing; mathematical modelling. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=26276 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:1:y:2009:i:4:p:433-455

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().