Tabu Search Heuristics for the Crane Sequencing Problem

Alan R. McKendall and Jin Shang

International Journal of Operational Research, 2008, vol. 3, issue 4, 412-429

Abstract: Determining the sequence of relocating items (or resources) moved by a crane from existing positions to newly assigned locations during a multi-period planning horizon is a complex combinatorial optimisation problem, which exists in power plants, shipyards, and warehouses. Therefore, it is essential to develop a good crane route technique to ensure efficient utilisation of the crane as well as to minimise the cost of operating the crane. This problem was defined as the Crane Sequencing Problem (CSP). In this paper, three construction and three improvement algorithms are presented for the CSP. The first improvement heuristic is a simple Tabu Search (TS) heuristic. The second is a probabilistic TS heuristic, and the third adds diversification and intensification strategies to the first. The computational experiments show that the proposed TS heuristics produce high-quality solutions in reasonable computation time.

Keywords: crane sequencing problem; diversification; heuristics; intensification; Tabu search; crane routes. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=19002 (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:ijores:v:3:y:2008:i:4:p:412-429

Access Statistics for this article

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