Document Type
Article
Publication Date
2009
College/Unit
Statler College of Engineering and Mining Resources
Department/Program/Center
Industrial and Managements Systems Engineering
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.
Digital Commons Citation
Shang, Jin and McKendall, Alan, "Solution Techniques for a Crane Sequencing Problem" (2009). Faculty & Staff Scholarship. 3066.
https://researchrepository.wvu.edu/faculty_publications/3066
Source Citation
title={Solution techniques for a crane sequencing problem}, author={Jin Shang and Alan McKendall}, journal={Int. J. Math. Oper. Res.}, year={2009}, volume={1}, pages={433-455}