The main concentration of the present work is to evaluate and analyze economic nature a system reliability model which allowed operate under varying weather conditions – normal abnormal. In this context consisting two non-identical units developed in initially unit operative duplicate at standby. Single repairmen/server comes immediately rectify fault whereas abnormal repair not feasible. techn...

This investigation deals with transient analysis of cold standby system with n units . Chapman-Kolmogorov equations are developed for repair facility with two repairmen and solved by using matrix technique. Availability and reliability factors have been obtained with probability of the system. A particular case has also been discussed.

We address the redundancy allocation of a series repairable system with multiple k-out-of-n subsystems with each subsystem following shut-off rule. The objective of the problem is to find the optimal number of repairmen and redundant components in each subsystem for optimization of steady-state availability subject to weight, cost and volume constraints. We propose a Particle Swarm Optimization...

We introduce a robot-safety device system attended by two di erent repairmen. The twin system is characterized by the natural feature of cold standby and by an admissible “risky” state. In order to analyse the random behaviour of the entire system (robot, safety device, repair facility), we employ a stochastic process endowed with probability measures satisfying general steady-state di erential...

Given an undirected graph G= (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starting at s and together covering all the vertices (customers) such that the sum of the latencies experienced by the customers is minimum. Latency of a customer p is defined to be the distance traveled (time elapsed) before v...

The Traveling Salesman Problem (TSP) is a classical problem in discrete optimization. Its paradigmatic character makes it one of the most studied in computer science and operations research and one for which an impressive amount of algorithms (in particular heuristics and approximation algorithms) have been proposed. While in the general case the problem is known not to allow any constant ratio...

This article discusses recent experiences with the Numeral Unit Spread Assessment Pedigree (NUSAP) system for multidimensional uncertainty assessment, based on four case studies that vary in complexity. We show that the NUSAP method is applicable not only to relatively simple calculation schemes but also to complex models in a meaningful way and that NUSAP is useful to assess not only parameter...