Solution techniques for a crane sequencing problem
by Jin Shang, Alan R. McKendall
International Journal of Mathematics in Operational Research (IJMOR), Vol. 1, No. 4, 2009

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.

Online publication date: Fri, 05-Jun-2009

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 Mathematics in Operational Research (IJMOR):
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