✦ LIBER ✦

An efficient simulated annealing algorithm for the redundancy allocation problem with a choice of redundancy strategies

✍ Scribed by Chambari, Amirhossain; Najafi, Amir Abbas; Rahmati, Seyed Habib A.; Karimi, Aida

Book ID: 120465212
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 551 KB
Volume: 119
Category: Article
ISSN: 0951-8320
DOI: 10.1016/j.ress.2013.05.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A variable neighbourhood search algorith

A variable neighbourhood search algorithm with novel archive update strategies for redundancy allocation problems

✍ Liang, Yun-Chia; Lo, Min-Hua 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 470 KB

An efficient algorithm for the location-

An efficient algorithm for the location-allocation problem with rectangular regions

✍ Ann S. Marucheck; Adel A. Aly 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 759 KB

Orthogonal simplified swarm optimization

Orthogonal simplified swarm optimization for the series–parallel redundancy allocation problem with a mix of components

✍ Yeh, Wei-Chang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 748 KB

Developing a new model for availability

Developing a new model for availability of a series repairable system with multiple cold-standby subsystems and optimization using simulated annealing considering redundancy and repair facility allocation

✍ Ali A. Yahyatabar Arabi, A. Eshraghniaye Jahromi 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 818 KB

Comparison of a genetic algorithm with a

Comparison of a genetic algorithm with a simulated annealing algorithm for the design of an ATM network

✍ Thompson, D.R.; Bilbro, G.L. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 56 KB

A simulated annealing algorithm with the

A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs

✍ Taichi Kaji; Azuma Ohuchi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 240 KB

In this paper, we present an approach for ®nding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satis®ed, based on the concept of simulated annealing. Simulated anneali