A HEURISTIC METHOD FOR SOLVING REDUNDANCY OPTIMIZATION PROBLEMS IN COMPLEX-SYSTEMS

Cited 36 time in webofscience Cited 0 time in scopus
  • Hit : 190
  • Download : 0
This paper presents a new heuristic method for solving constrained redundancy optimization problems in complex systems. The proposed method allows excursions over a bounded infeasible region, which can alleviate the risks of being trapped at a local optimum. Computational results show that our method performs consistently better than other heuristic methods (Shi, Kohda & Inoue, simulated annealing) in terms of solution quality. In terms of computing time, the Shi method is best while simulated annealing is the slowest. Comparing our and the Kohda & Inoue methods, we observe moderate increase in computing time for the former. In summary, if computing time is of primary concern, then we recommend the Shi method among the heuristic methods we considered. If, however, solution quality is of more concern and if one is willing to accept moderate increase in computing time for better solutions, then we believe that our method is an attractive alternative to other heuristic methods.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
1993-12
Language
ENG
Article Type
Article
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 36 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0