Simulated annealing heuristics for managing resources during planned outages at electric power plants

Authors:
Alan R. McKendall, Jr;James S. Noble;Cerry M. Klein
Affiliations:
Department of Industrial & Management Systems Engineering, 325A Mineral Resources Building, PO Box 6070, West Virginia University, Morgantown, WV;Department of Industrial & Manufacturing Systems Engineering, E3437 Engineering Building East, University of Missouri-Columbia, Columbia, MO;Department of Industrial & Manufacturing Systems Engineering, E3437 Engineering Building East, University of Missouri-Columbia, Columbia, MO
Venue:
Computers and Operations Research
Year:
2005

Citing 0
Cited 4

A tabu search heuristic for the dynamic space allocation problem

Computers and Operations Research
Improved Tabu search heuristics for the dynamic space allocation problem

Computers and Operations Research
A tabu search heuristic for the dynamic space allocation problem

Computers and Operations Research
The dynamic space allocation problem: Applying hybrid GRASP and Tabu search metaheuristics

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a mathematical model and simulated annealing heuristics for assigning activities to workspaces and resources (e.g., equipment, parts, and toolboxes) to work/storage spaces during planned outages at electric power plants. These assignments are made such that the distance resources (toolboxes) travel throughout the duration of the outage is minimized. This problem is defined as the dynamic space allocation problem. To test the performance of the proposed techniques, a data set is generated and used in the analysis. The results show that the simulated annealing heuristics perform well with respect to solution quality and computational time.