Search published articles

Showing 4 results for Nasiri

Zohreh Zahedian, Mohammad Mahdi Nasiri,
Volume 25, Issue 3 (IJIEPR 2014)

In this paper, we develop a freight transportation model for railway network considering hazmat transportation issue. In the transportation system considered, different customers can request for carrying hazmat and non- hazmat boxes. It is assumed that the sequence of the trains in the network is known. The objective is assigning the non-hazmat boxes and hazmat boxes to wagons of the trains so that the transportation becomes safer. A zero-one integer programming model is presented that minimizes the cost of safe transportation. The model is solved using a new fuzzy approach.
Mohammad Mahdi Nasiri, Nafiseh Shamsi Gamchi, Seyed Ali Torabi,
Volume 27, Issue 4 (IJIEPR 2016)

Hubs are critical elements of transportation networks. Location of hubs and allocation of demands to them are of high importance in the network design. The most important purpose of these models is to minimize the cost, but path reliability is also another important factor which can influence the location of hubs. In this paper, we propose a P-center hub location model with full interconnection among hubs while there are different paths between origins and destinations. The purpose of the model is to determine the reliable path with lower cost. Unlike the prior studies, the number of hubs in the path is not limited to two hubs. The presented model in this paper is bi-objective and includes cost and reliability to determine the best locations for hubs, allocation of the demands to hubs and the best path. In order to illustrate our model, a numerical example is presented and solved using the Cuckoo Optimization Algorithm.

Farzaneh Nasirian, Mohammad Ranjbar,
Volume 28, Issue 2 (IJIEPR 2017)

Public transportation has been one of the most important research fields in the two last decades. The purpose of this paper is to create a schedule for public transport fleets such as buses and metro trains with the goal of minimizing the total transfer waiting time. We extend previous research works in the field of transit schedule with considering headways of each route as decision variables. In this paper, we formulate the problem as a mixed integer linear programming model and solve it using ILOG CPLEX solver. For large-scale test instances, we develop a metaheuristic based on the scatter search algorithm to obtain good solutions in a reasonable CPU run times. Finally, in the computational section, the efficiency of the proposed model and developed algorithm are compared with the existing results in the literature on a real railway network.

Mojtaba Hamid, Mahdi Hamid, Mohammad Mahdi Nasiri, Mahdi Ebrahimnia,
Volume 29, Issue 2 (IJIEPR 2018)

Surgical theater is one of the most expensive hospital sources that a high percentage of hospital admissions are related to it. Therefore, efficient planning and scheduling of the operating rooms (ORs) is necessary to improve the efficiency of any healthcare system. Therefore, in this paper, the weekly OR planning and scheduling problem is addressed to minimize the waiting time of elective patients, overutilization and underutilization costs of ORs and the total completion time of surgeries. We take into account the available hours of ORs and the surgeons, legal constraints and job qualification of surgeons, and priority of patients in the model. A real-life example is provided to demonstrate the effectiveness and applicability of the model and is solved using ε-constraint method in GAMS software. Then, data envelopment analysis (DEA) is employed to obtain the best solution among the Pareto solutions obtained by ε-constraint method. Finally, the best Pareto solution is compared to the schedule used in the hospitals. The results indicate the best Pareto solution outperforms the schedule offered by the OR director.

Page 1 from 1     

© 2019 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb