A SIMULATED ANNEALING HEURISTIC FOR A CRANE SEQUENCING PROBLEM

Authors

  • Alan R McKendall IDepartment ofIndustrial & Management Systems Engineering West Virginia University
  • Jin Shang IDepartment ofIndustrial & Management Systems Engineering West Virginia University
  • James S. Noble Department ofIndustrial & Manufacturing Systems Engineering University of Missouri-Columbia
  • Cerry M Klein Department ofIndustrial & Manufacturing Systems Engineering University of Missouri-Columbia

DOI:

https://doi.org/10.23055/ijietap.2006.13.1.426

Keywords:

Crane Sequencing Problem, Simulated Annealing, Meta-heuristic, Outage Planning, Electric Power Plants

Abstract

When maintenance activities during outages at electric power plants are scheduled using project managemenr

software, the locations of the resources required to perform the acrivities are determined such that the total distance the

resources travel during the outage is minimized. This problem is defined as the dynamic space allocation problem (DSAP).

Once the DSAP solution (i.e., assignment of activities and their required resources to workspaces and of idle resources to

storage spaces) is obtained, the problem then is to determine the sequence in which the crane moves the resources to their

required locations at the beginning of each period (i.e., change in the schedule) such that the total distance the crane travels

is mininlized. In this paper, this problem is defined as the crane sequencing problem (CSP), and a simulated annealing

heuristic is presented for this problem.

Downloads

Published

2022-02-24

How to Cite

McKendall, A. R., Shang, J., Noble, J. S., & Klein, C. M. (2022). A SIMULATED ANNEALING HEURISTIC FOR A CRANE SEQUENCING PROBLEM. International Journal of Industrial Engineering: Theory, Applications and Practice, 13(1), 90–98. https://doi.org/10.23055/ijietap.2006.13.1.426

Issue

Section

Operations Research