Search published articles

Showing 4 results for Ramezanian

R. Ramezanian, M.b. Aryanezhad , M. Heydari,
Volume 21, Issue 2 (IJIEPR 2010)

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapted genetic algorithm based on bypass consideration to solve the problem. The basic parameters of this meta-heuristic are briefly discussed in this paper. Also a computational experiment is conducted to evaluate the performance of the implemented methods. The implemented algorithm can be used to solve large scale flow shop scheduling problem with bypass effectively .

Amin Saghaeeian, Reza Ramezanian,
Volume 28, Issue 4 (IJIEPR 2017)

This study considers pricing, production and transportation decisions in a Stackelberg game between three-stage, multi-product, multi-source and single-period supply chains called leader and follower. These chains consist of; manufacturers, distribution centers (DCs) and retailers. Competition type is horizontal and SC vs. SC. The retailers in two chains try to maximize their profit through pricing of products in different markets and regarding the transportation and production costs. A bi-level nonlinear programming model is formulated in order to represent the Stackelberg game. Pricing decisions are based on discrimination pricing rules, where we can put different prices in different markets. After that the model is reduced to single-level nonlinear programming model by replacing Karush-Kuhn-Tucker conditions for the lower level (follower) problem. Finally, a numerical example is solved in order to analyze the sensitivity of effective parameters on price and profit.

Reza Ramezanian, Maryam Afkham,
Volume 31, Issue 2 (IJIEPR 2020)

A non-linear bi-level problem is suggested in this paper for wildfire self-evacuation planning, the upper problem of which includes binary variables and the lower problem includes continuous variables. In this model, the upper problem selects a number of links and adds them to the available evacuation network. It, moreover, predicts the traffic balance, and the time window of the links in the lower problem. A part of the objective function in the bi-level problem is non-linear which is linearized with a linear approximation method that does not require binary variables. Then the linear bi-level model is reformulated as a non- linear single level problem. This model is linearized and transferred into Mixed Integer Programing. The model is then used for the real case study of the Beechworth fire in 2009. The resulted outputs of the model are beneficial in planning design schemes for emergency evacuation to use the maximum potential of the available transportation network.
Reza Ramezanian, Soleiman Jani,
Volume 32, Issue 3 (IJIEPR 2021)

In this paper, a fuzzy multi-objective optimization model in the logistics of relief chain for response phase planning is addressed. The objectives of the model are: minimizing the costs, minimizing unresponsive demand, and maximizing the level of distribution and fair relief. A multi-objective integer programming model is developed to formulate the problem in fuzzy conditions and transformed to the deterministic model using Jime'nez approach. To solve the exact multi-objective model, the ε-constraint method is used. The resolved results for this method have shown that this method is only able to find the solution for problems with very small sizes. Therefore, in order to solve the problems with medium and large sizes, multi-objective cuckoo search optimization algorithm (MOCSOA) is implemented and its results are compared with the NSGA-II. The results showed that MOCSOA in all cases has the higher ability to produce higher quality and higher-dispersion solutions than NSGA-II.

Page 1 from 1