Authors: Alan R. McKendall, Jin Shang
Addresses: Department of Industrial and Management Systems Engineering, West Virginia University, 325A Mineral Resources Building, PO BOX 6070, Morgantown, WV 26506, USA. ' Quality Planning Corporation, 388 Market Street, Suite 750, San Francisco, CA 94111, USA
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.
International Journal of Operational Research, 2008 Vol.3 No.4, pp.412 - 429
Available online: 27 Jun 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article