Search

Purpose: In emergency services, maximizing population coverage with the lowest cost at the peak of the demand is important. In addition, due to the nature of services in emergency centers, including hospitals, the number of servers and beds is actually considered as the capacity of the system. Hence, the purpose of this paper is to propose a multi-objective maximal covering facility location model for emergency service centers within an M (t)/M/m/m queuing system considering different levels of service and periodic demand rate. Design/methodology/approach: The process of serving patients is modeled according to queuing theory and mathematical programming. To cope with multi-objectiveness of the proposed model, an augmented ε-constraint method has been used within GAMS software. Since the computational time ascends exponentially as the problem size increases, the GAMS software is not able to solve large-scale problems. Thus, a NSGA-II algorithm has been proposed to solve this category of problems and results have been compared with GAMS through random generated sample problems. In addition, the applicability of the proposed model in real situations has been examined within a case study in Iran. Findings: Results obtained from the random generated sample problems illustrated while both the GAMS software and NSGA-II almost share the same quality of solution, the CPU execution time of the proposed NSGA-II algorithm is lower than GAMS significantly. Furthermore, the results of solving the model for case study approve that the model is able to determine the location of the required facilities and allocate demand areas to them appropriately. Originality/value: In the most of previous works on emergency services, maximal coverage with the minimum cost were the main objectives. Hereby, it seems that minimizing the number of waiting patients for receiving services have been neglected. To the best of the authors' knowledge, it is the first time that a maximal covering problem is formulated within an M (t)/M/m/m queuing system. This novel formulation will lead to more satisfaction for injured people by minimizing the average number of injured people who are waiting in the queue for receiving services. [ABSTRACT FROM AUTHOR]

The railroad blocking problem (RBP) is an important decision for freight railroad companies. The objective of this problem is to minimize the costs of delivering all commodities by deciding which interyard blocks to build and specifying the assignment of commodities to these blocks. In this paper, a mathematical model is presented for the RBP on Iran Railways. Its decision variables identify blocking scheme and demand assignment to these blocks. The RBP in medium and large sizes is not solvable with any commercial software available in the market. Therefore, a solution method based on tabu search algorithm is proposed for the suggested model. For evaluating the proposed algorithm, several simulated test problems are randomly generated and solved. The obtained results on the test problems are compared with those of solutions generated by CPLEX software. The comparison shows high efficiency and effectiveness of the proposed algorithm. The proposed model and solution method are applied to build a blocking plan for the Iranian railway. [ABSTRACT FROM AUTHOR]

This paper presents a nature-based algorithm, titled multivariable teaching-learning-based optimization (MTLBO) algorithm. MTLBO algorithm during an iterative process can estimates the best values of the buried structure (model) parameters in a multi-objective problem. The algorithm works in two computa-tional phases: the teacher phase and the learner phase. The major purpose of the MTLBO algorithm is to modify the value of the learners and thus, improving the value of the model parameters which leads to the optimal solution. The variables of each learner (model) are the depth (z), amplitude coefficient (k), shape factor (q), angle of effective magnetization (Î,) and axis location (x0) parameters. We employ MTLBO method for the magnetic anomalies caused by the buried structures with a simple geometric shape such as sphere and horizontal cylinder. The efficiency of the MTLBO is also studied by noise corruption synthetic data, as the acceptable results were obtained. We have applied the MTLBO for the interpretation of the four magnetic anomaly profiles from Iran, Brazil and India. [ABSTRACT FROM AUTHOR]

A common method for assessing the energy potential of hydropower systems in Iran is the sequential streamflow routing with control on the energy-yield reliability. The method results in developing a reliability-based simulation (RBS) model that is used to analyze single-reservoir hydropower systems. In most of the cascade hydropower systems in the country, a single-reservoir RBS model is usually employed in the design and operation of each of the systems reservoirs. This paper presents a multireservoir RBS model considering the integrated operation of the systems. The model employs the general algorithm of the single-reservoir RBS model; however, with a single-period optimization submodel in determining releases from reservoirs during the system simulation. The objective function of the submodels minimizes the sum of reservoir releases and/or maximizes the sum of reservoir storages in each of the time periods, subject to a reliability constraint on the system’s energy yield. The single and multireservoir RBS models are applied in the Khersan hydropower system located in Iran as a case study. The multireservoir RBS, compared to the single-reservoir model, results in 7.9% excess firm-energy yield in reliability of 90%. [ABSTRACT FROM AUTHOR]

The optimal allocation and sizing of distributed generation (DG) resources are important in installing these resources, to improve the technical parameters of the network, including the power losses, voltage profile, and short-circuit level, as well as to increase economic factors. In this paper, a new multi-criteria algorithm and objective function are proposed for the optimal sizing and allocation of renewable and non-renewable DG resources simultaneously. The proposed algorithm is implemented on 63/20 kV substations at 20 kV levels. In the proposed objective function, all important technical and economic factors as well as important constraints, such as penetration level of DGs and budget constraint, are considered in a way that all factors are assigned to monetary values. Moreover, a new mathematical formulation is introduced for the allocation of renewable DG resources to reduce run-time optimization. The genetic algorithm (GA) is employed in the proposed algorithm to minimize the objective function. For renewable DG resources, photovoltaic panels and wind turbines, and for non-renewable DG resources, gas turbines are considered. The 115 buses network of Bakhtar Regional Electric Company (BREC) in Iran is used to evaluate the performance of the proposed algorithm. The results demonstrate that the proposed algorithm improves technical factors efficiently and maximizes the profitability of the investment. [ABSTRACT FROM AUTHOR]

In the current highly competitive airline market, many companies have failed due to their low revenue rates. For this reason, many of them have to develop strategies to increase their revenue. In this study, we develop revenue management (RM) strategy for the Iranian airline industry. More specifically, we present a mathematical model that considers some conditions not studied in previous research in order to provide a more realistic RM modeling of airlines that fits well for the special characteristics of Iranian Airways. A binary differential evolution algorithm is employed to solve the model due to the stochastic nature of data and the NP-hardness of the considered problem. To generate maximum revenue among the six types of airplanes that fly the four capital cities of Iran, the airline under investigation is advised to operate only 21 flights to those cities and cancel the rest of the flights. [ABSTRACT FROM AUTHOR]