Document Type
Article
Publication Date
2008
College/Unit
Statler College of Engineering and Mining Resources
Department/Program/Center
Industrial and Managements Systems Engineering
Abstract
Determining the sequence of relocating items (or resources) moved by a crane from existing positions to newly assigned locations during a multiperiod 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 minimize 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.
Digital Commons Citation
McKendall, Alan, "Tabu Search Heuristics for the Crane Sequencing Problem" (2008). Faculty & Staff Scholarship. 3067.
https://researchrepository.wvu.edu/faculty_publications/3067