ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Computers & Operations Research
Volume 32, Issue 1, January 2005, Pages 107-125
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (253 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
Special issue
View Record in Scopus
 
doi:10.1016/S0305-0548(03)00206-5    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier Ltd. All rights reserved.

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

Alan R. McKendall, Jr Corresponding Author Contact Information, E-mail The Corresponding Author, a, James S. Nobleb and Cerry M. Kleinb

a Department of Industrial & Management Systems Engineering, 325A Mineral Resources Building, PO Box 6070, West Virginia University, Morgantown, WV 26506, USA b Department of Industrial & Manufacturing Systems Engineering, E3437 Engineering Building East, University of Missouri-Columbia, Columbia, MO 65211, USA

Received 17 December 2002. 
Available online 29 July 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

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.

Author Keywords: Dynamic space allocation problem; Simulated annealing; Integer programming model; Outage planning; Electric power plants

Article Outline

1. Introduction
2. The dynamic space allocation problem model
2.1. Problem definition
2.2. Problem assumptions
2.3. Mathematical notation
2.4. Mathematical formulation
2.5. Small problem instance
3. Simulated annealing heuristics for the DSAP
4. Computational results
5. Conclusion
Acknowledgements
References





 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.