The nozzle guide vane problem: Partitioning a heterogeneous inventory |
| |
| Institution: | 1. College of Electrical and Power Engineering, Taiyuan University of Technology, Taiyuan 030024, Shanxi, China;2. Key Laboratory of Clean and Efficient Combustion and Utilization in the Circulating Fluidized Bed, Taiyuan 030024, Shanxi, China;1. Department of Mechanical Engineering, Saga University, Saga 840-8502, Japan;2. Graduate School of Science and Engineering, Saga University, Saga 840-8502, Japan;3. International Institute for Carbon-Neutral Energy Research, Kyushu University, Fukuoka 819-0385, Japan |
| |
| Abstract: | In this paper we describe a problem which is encountered in the maintenance of gas turbine engines used in commercial and military aircraft. In particular, we address the problem of selecting a set of nozzle guide vanes, from a heterogeneous inventory of vanes, for the nozzle assembly of an engine. We formulate this problem as a partitioning problem for a heterogeneous population. Given the combinatorial complexity of the problem we develop a heuristic algorithm which is shown to be very effective in obtaining the maximum number of partitions. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
