Search published articles

Showing 11 results for Mohammadi

S. Shojaee, M. Mohammadian,
Volume 1, Issue 1 (3-2011)

This paper proposes an effective algorithm based on the level set method (LSM) to solve shape and topology optimization problems. Since the conventional LSM has several limitations, a binary level set method (BLSM) is used instead. In the BLSM, the level set function can only take 1 and -1 values at convergence. Thus, it is related to phase-field methods. We don’t need to solve the Hamilton-Jacobi equation, so it is free of the CFL condition and the reinitialization scheme. This favorable properties lead to a great time advantage in this method. In this paper, the BLSM is implemented with the additive operator splitting (AOS) scheme and several numerical issues of the implementation are discussed. The proposed scheme is much more efficient than the conventional level set method. Several 2D examples are presented which demonstrate the effectiveness and robustness of the proposed method.
S.h. MirMohammadi, Sh. Shadrokh, K. Eshghi,
Volume 2, Issue 2 (6-2012)

The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the ordering time. The properties of an optimal order policy are argued and on the basis of them, a branch and bound algorithm is presented to construct an optimal sequence of order policies. In the proposed B&B algorithm, some useful fathoming rules have been proven to make the algorithm very efficient. By defining a rooted tree graph, it has been shown that the worst-case time complexity function of the presented algorithm is polynomial. Finally, some test problems which are randomly generated in various environments are solved to show the efficiency of the algorithm.
S. Gholizadeh, V. Aligholizadeh , M. Mohammadi,
Volume 4, Issue 1 (3-2014)

In the present study, the reliability assessment of performance-based optimally seismic designed reinforced concrete (RC) and steel moment frames is investigated. In order to achieve this task, an efficient methodology is proposed by integrating Monte Carlo simulation (MCS) and neural networks (NN). Two NN models including radial basis function (RBF) and back propagation (BP) models are examined in this study. In the proposed methodology, MCS is used to estimate the total exceedence probability associated with immediate occupancy (IO), life safety (LS) and collapse prevention (CP) performance levels. To reduce the computational burden of MCS process, the required nonlinear responses of the generated structures are predicted by RBF and BP models. The numerical results imply the superiority of BP to RBF in prediction of structural responses associated with performance levels. Finally, the obtained results demonstrate the high efficiency of the proposed methodology for reliability assessment of RC and steel frame structures.
A. Gholizad , S. D. Ojaghzadeh Mohammadi,
Volume 4, Issue 1 (3-2014)

Structural vibration control is one of the most important features in structural engineering. Real-time information about seismic resultant forces is required for deciding module of intelligent control systems. Evaluation of lateral forces during an earthquake is a complicated problem considering uncertainties of gravity loads amount and distribution and earthquake characteristics. An artificial neural network (ANN) has been trained in this article to estimate these forces. This ANN was trained on the results of time history analysis of a three-story building under 702 different loadings. Results of numerical examples verify that the trained ANN can predict the expected forces with negligible deviations.
M. Shahrouzi , A. Mohammadi,
Volume 4, Issue 3 (9-2014)

Dynamic structural responses via time history analysis are highly dependent to characteristics of selected records as the seismic excitation. Ground motion scaling is a well-known solution to reduce such a dependency and increase reliability to the dynamic results. The present work, formulate a twofold problem for optimal spectral matching and performing consequent sizing optimization based on such scaled ground motion via numerical step-by-step analyses. Particle swarm optimization as a widely used meta-heuristic is specialized and improved to solve this problem treating a number of examples. The scaling error is evaluated using both traditional procedure and the developed method. In this regard, some issues are studied including the effect of structural period and shape of the design spectrum on the results. Contribution of the proposed enhancement on the standard particle swarm intelligence has improved its explorative capability resulting in higher efficiency of the algorithm.
A. Kaveh, O. Khadem Hosseini, S. Mohammadi, V. R Kalat Jari, A. Keyhani,
Volume 4, Issue 4 (11-2014)

Z. Hajishafee , S.h. MirMohammadi , S.r. Hejazi,
Volume 5, Issue 1 (1-2015)

The overall cost of companies dealing with the distribution tasks is considerably affected by the way that distributing vehicles are procured. In this paper, a more practical version of capacitated vehicle routing problem (CVRP) in which the decision of purchase or hire of vehicles is simultaneously considered is investigated. In CVRP model capacitated vehicles start from a single depot simultaneously and deliver the demanded items of several costumers with known demands where each costumer must be met once. Since the optimal vehicle procurement cost is a function of total distance it traverses during the planning horizon, the model is modified in a way that the decision of purchasing or hiring of each vehicle is made simultaneously. The problem is formulated as a mixed integer programming (MIP) model in which the sum of net present value (NPV) of procurement and traveling costs is minimized. To solve the problem, a hybrid electromagnetism and parallel simulated annealing (PSA-EM) algorithm and a Shuffled Frog Leaping Algorithm (SFLA) are presented. Finally, the presented methods are compared experimentally. Although in some cases the SFLA algorithm yields better solutions, experimental results show the competitiveness of PSA-EM algorithm from the computational time and performance points of view.
Y. Malekian , S.h. MirMohammadi,
Volume 5, Issue 3 (8-2015)

In this study, a two-echelon supplier-manufacturer system with finite production rate and lead time is proposed. It is assumed that shortage is not permitted and the lot size of manufacturer (second echelon) is m-factors of the lot size of supplier (first echelon) and supplier can supply the manufacturer’s lot size in several shipments in each cycle. So, the production rate of supplier is greater than manufacturer’s. The proposed model aims to determine the optimal lot-size of each echelon such that the total cost of system is minimized. First, the problem is studied regardless of lead time and the optimal value of the lot sizes and the number of shipments is determined through analytical relations. Then, an exact solution algorithm for the problem is presented for the case with non-zero lead time. Finally, the performance of the proposed algorithm is reviewed by solving some numerical instances of the problem.
S. Khosravi, S. H. MirMohammadi,
Volume 6, Issue 2 (6-2016)

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In 
this paper, stochastic dynamic lot sizing problem with considering the quantity discount is defined  and  formulated.  Since  the  considered  model  is  mixed  integer  non-linear programming,  a  piecewise  linear  approximation  is  also  presented.  In  order  to  solve  the mixed integer non-linear programming, a branch and bound algorithm are presented. Each node in the branch and bound algorithm is also MINLP which is solved based on dynamic programming framework. In each stage in this dynamic programming algorithm, there  is a sub-problem which can be solved with lagrangian relaxation method. The numeric results found in this  study indicate that the proposed algorithm solve the problem faster than the mathematical  solution  using  the  commercial  software  GAMS.  Moreover,  the  proposed algorithm for  the  two  discount  levels  are  also  compared  with  the  approximate  solution  in mentioned software. The results indicate that our algorithm up to 12 periods not only can reach to the exact solution, it consumes less time in contrast to the approximate model.

S. H. MirMohammadi, E. Babaee Tirkolaee, A. Goli, S. Dehnavi - Arani,
Volume 7, Issue 1 (1-2017)

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip is developed with this assumption that urban traffic would disrupt timely services. The objective function of proposed problem is to minimize the total amount of carbon dioxide emissions produced by the vehicle, earliness and lateness penalties costs and costs of used vehicles. At first, a novel linear integer mathematical model is formulated and then the model is validated via solving some test problems by CPLEX solver. Finally, the sensitivity analysis is carried out to study the role of two critical parameters in the optimal solution.

R. Ghousi, M. Khanzadi, K. Mohammadi Atashgah,
Volume 8, Issue 3 (10-2018)

Construction industry has the highest ratio of fatality of workers in comparison with other industries. Construction safety has been always a matter of focus to control safety risks. This article presents a new flexible method of safety risk assessment by adding Hybrid Value Number (HVN) to the assessment equation. As a result of using this method, the results of assessment process will be more consistent with the project’s conditions, as well as being more trustful. It could provide a better perspective of safety risks for project managers. The most significant outcomes of this research are as follows: 1) the most influential factors which affect safety risks in building construction projects are "the proficiency and the experience of workers", "the complexity of construction technology" and "time limitation", 2) the biggest risk priority numbers belong to "Struck by falling objects" and "Falling to lower levels" hazards, 3)a necessary safety program must contain Personal Protective Equipment (PPE), safety measures and safety training, 4)Project managers can decrease 75% of total safety risks by investing less than 1.5% of construction budget on safety programs.

Page 1 from 1     

© 2019 All Rights Reserved | Iran University of Science & Technology

Designed & Developed by : Yektaweb