[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
Main Menu
Journal Information::
Articles archive::
Submission Instruction::
Submit article::
Site Facilities::
Contact us::
Google Scholar

Citation Indices from GS

AllSince 2015

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Search published articles ::
Showing 3 results for Reliability

M. Forghani-Elahabad, N. Mahdavi-Amiri,
Volume 4, Issue 2 (10-2013)

A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the literature on search for all d-MCs are investigated. We show that some existing results and the corresponding algorithms are incorrect. Then, correct versions of the results are established. By modifying an incorrect algorithm, we also propose an improved algorithm. In addition, complexity results on a number of studies are shown to be erroneous and correct counts are provided. Finally, we present comparative numerical results in the sense of performance profile of Dolan and Moré showing the proposed algorithm to be more efficient than some existing algorithms.
Dr Davood Shishebori,
Volume 7, Issue 1 (4-2016)

We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expected transshipment costs in usual and disruption conditions). The motivating application of this class of problem is in capacitated logistics network design with multi configuration (including multi-product, multi-vehicle, and multi-type link) regarding system disruptions simultaneously. The problem is modelled as a mixed integer program. Also, a hybrid heuristic algorithm is proposed. The algorithm, as an efficient approach, is a hybridization of sample average approximation, the LP relaxation, and a two stage decomposing heuristic. The results of a detailed comprehensive computational analysis are also reported. Computational experiments illustrate that the provided algorithm is able to substantially outperform the integer programming approach in terms of both finding and verifying the efficient optimal (or near optimal) solutions at reasonable processing times.

Mr. Hassan Heidari-Fathian, Dr. Seyyed Hamid Reza Pasandideh,
Volume 8, Issue 1 (4-2017)

A multi-periodic, multi-echelon green supply chain network consisting of manufacturing plants, potential distribution centers, and customers is developed. The manufacturing plants can provide the products in three modes including production in regular time, production in over time, or by subcontracting. The problem has three objectives including minimization of the total costs of the green supply chain network, maximization of the average safe inventory levels of the manufacturing plants and the distribution centers and minimization of the environmental impacts of the manufacturing plants in producing, holding and dispatching the products and also the environmental impacts of the distribution centers in holding and dispatching the products. The problem is first formulated as a mixed-integer mathematical model. Then, in order to solve the model, the augmented weighted Tchebycheff method is employed and its performance in producing the Pareto optimal solutions is compared with the goal attainment method.

Page 1 from 1     

مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.04 seconds with 29 queries by YEKTAWEB 4227