RRReza Ramezanian

Reza Ramezanian

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Reza Ramezanian has a total of 66 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Enhanced Benders Decomposition Framework for health Care Scheduling Problems: A case study of Covid-19

    by Niloofar Sadat Akhavi, Reza Ramezanian, Mir Saman Pishvaee

    During pandemic situations, hospitals experiencing shortages of ICU beds and medical staff require coherent and effective control systems. Insufficient medical personnel increases workload pressure, which may negatively affect patient recovery rates. Although societal restriction protocols can temporarily reduce patient inflow during peak periods, such measures are unsustainable in the long term, making subsequent infection waves inevitable. This study proposes a fair and accessible resource allocation framework to mitigate patient overload and reduce burnout among medical staff, while simultaneously considering optimal capacity expansion through the establishment of temporary healthcare centers. The resulting large-scale optimization problem is solved using a developed Benders Decomposition Algorithm (BDA). To improve computational efficiency, a novel theoretical enhancement is introduced to accelerate convergence, drawing on classical Operations Research concepts, including duality properties and the Complementary Slackness Theorem (CST). The performance of the proposed enhancement is evaluated against the Pareto-optimal cut. Uncertainty in patient demand, as a defining feature of pandemic conditions, is modeled using Fuzzy Scenario-based Programming (FSP). Several approaches are employed to prioritize fairness and accessibility in resource allocation as wait-and-see decisions. A real-world case study of hospitals in northeastern Tehran is conducted under six scenario-generation cases. By applying the capacity shortage ratio, it becomes possible to allocate ICU bed capacity in each period to non–COVID-19 patients. In the worst-case scenario, there is a capacity shortage in all periods, even for the admission of COVID-19 patients, whereas in the best scenario, at least 50% of the capacity can be allocated to non–COVID-19 emergency patients. The findings indicate that, in the worst case, a 20% increase in hospital capacity results in a 74% reduction in the shortage.

  • Open Access

    A Scalable Optimization Framework for Multi-Trip Container Drayage with Practical Operational Constraints

    by Zahra Ghaffari, Reza Ramezanian

    Multi-trip container drayage operations play a critical role in port–hinterland logistics, yet they are often characterized by complex operational rules such as trip limits, container-type compatibility, and practical handling constraints. Many existing models simplify these aspects to maintain tractability, which limits their applicability in real-world settings.This paper addresses the multi-trip container drayage problem by proposing an operationally grounded mixed-integer linear programming formulation that explicitly incorporates practical container-handling rules and trip-related constraints commonly observed in port operations. The model captures realistic operational features without introducing excessive modeling complexity, making it suitable for large-scale instances.To solve large problem instances where exact optimization becomes computationally intractable, two scalable solution approaches based on Proximal Policy Optimization (PPO) and a Genetic Algorithm (GA) are developed. These methods construct feasible multi-trip drayage plans while respecting operational constraints and are evaluated under equal computational budgets.Computational experiments on instances of varying sizes demonstrate that the proposed approaches can efficiently generate high-quality solutions and exhibit favorable scalability and stability properties. The results highlight the value of incorporating realistic operational rules into multi-trip drayage planning and provide practical insights for large-scale container transportation systems.

  • A stochastic bi-objective project scheduling model under failure of activities

    by Fatemeh Rezaei, Amir Abbas Najafi, Erik Demeulemeester, Reza Ramezanian


  • Group buying vs individual buying; a competitive approach for two retailers

    by Hossein Heydarian, Reza Ramezanian

    Development of technology and expansion of social media emerge group-buying mechanism as a popular strategy. In this paper, two competitive retailers are considered that sell the same product to customer in a market, Group buying and individual buying. Three Different competition scenarios are considered, in order to implement the first two strategies, the Stackelberg model is used where the group-buying retailer and the Individual retailer are assumed to be the leader and follower, respectively. For the third strategy, the Nash equilibrium is applied when they decide separately. We analysis the optimal and equilibrium strategy in each scenario. And also determine the conditions for each retailer to be present in the market in each scenarios. Finally, a numerical example is provided, in order to illustrate the effectiveness of the aforementioned three scenarios in models.

  • A greedy heuristic algorithm to solve a VRP-based model for planning and coordinating multiple resources in emergency response to bushfires

    by Asudeh Shahidi, Reza Ramezanian, Shahrooz Shahparvari

    Uncoordinated responses have always caused problems in any kind of operation, in particular, for crucial circumstances it is considerable. As uncoordinated responses in bushfire are also associated with decreased efficiency, effectiveness, and safety, we proposed a new VRP-based mathematical coordination model for routing and allocating resources in fire suppression phase of a bushfire event. The focus of this paper is to plan and coordinate the available resources (ground and aerial resources) for efficient fire suppression. problem is NP-hard, but due to the crucial circumstances of bushfire it should be solved in a reasonable time. Therefore, we proposed an efficient greedy heuristic to solve it. We presented test cases with different characteristics that in those that CPLEX can solve them, the results are compared with the solution of the heuristic. We considered a unit of fire within an incident as a fire site. CPLEX fails to solve cases with more than three fire sites, but the proposed greedy heuristic solves cases with 9 fire sites in less than 1 minute. As the optimality RPD of the heuristic is 00.00% for the first three cases and it is also ignorable in the next two cases, it indicates that our algorithm is reliable.


  • Resilience-based mathematical model to restore disrupted road-bridge transportation networks

    by Samin Somy, Rasoul Shafaei, Reza Ramezanian

    The transportation network resiliency plays a significant role in reducing the devastating impacts of a disaster. This paper develops a mathematical model to improve the resilience of road–bridge transportation networks in the recovery phase. The model consists of two objective functions. The first objective function minimises total recovery time, and the second one prioritises damaged bridges for restoration to increase network performance level in an early stage by maximising the skewness of the recovery trajectory. This paper considers disrupted bridges as repair projects and schedules a network of recovery tasks with precedence relationships to restore each bridge while considering resource constraints. Thus, it is similar to the resource–constraint multi-project scheduling problem. A genetic algorithm is applied to solve the model for a large-scale hypothetical road–bridge transport network, and the highway network of Shelby County, TN, the USA, following a seismic hazard. Different recovery task networks are considered to restore disrupted bridges. Three communities with rich, average and poor resources are compared to evaluate the impact of different community investment structures on the recovery process and network recovery time. The results show that the proposed restoration plan leads to achieving the best recovery trajectory and shortest total recovery time.


  • Stochastic optimization for the carrier selection problem in humanitarian relief

    by Reza Ramezanian, Milad Ghorbani

    In this paper, the carrier selection problem is addressed with the purpose of avoiding shortage regarding vehicle necessity and creating a vehicle rental framework agreement. Achieving in-time delivery of relief supplies to the disaster inflicted areas is of utmost significance in terms of humanitarian relief. We propose a new two-stage stochastic model for determining the pre-disaster and post-disaster decisions in order to delivering relief items to the injured survivors. The pre-disaster phase focuses on determining amount of vehicle in the framework of contracts with suppliers, and deciding an appropriate coverage distance with regards to time and cost. The post-disaster phase aims to respond to the requests made by disaster inflicted areas swiftly and cost-effectively. The proposed MILP model considers a scenario-based approach to handle the uncertainty of demand. The L-shaped algorithm is used to solve this model. A real case study is presented with the aim of demonstrating the efficiency of the model. Moreover, numerical analyses are practiced to illustrate the importance and impact of the cost and the number of vehicle rental contracts in the studied problem. Finally, managerial insights have been presented to assist the relief organization management in making appropriate and efficient decisions.