Tabu Search Heuristics for the Crane Sequencing Problem
by Alan R. McKendall, Jin Shang
International Journal of Operational Research (IJOR), Vol. 3, No. 4, 2008

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.

Online publication date: Fri, 27-Jun-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com