Behrouz Afshar-Nadjafi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Behrouz Afshar-Nadjafi has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Hamidreza Maghsoudlou
Qazvin Branch, Islamic Azad University
4 shared publications- Seyed Taghi Akhavan Niaki
Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran
4 shared publications Hamed Soleimani
3 shared publications- Mahnaz Sohrabi
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
2 shared publications Maryam Momeni
2 shared publications- Mostafa Zandieh
Department of Industrial Management and Information Technology, Faculty of Management and Accounting, Shahid Beheshti University, Tehran, Iran
2 shared publications
Latest Publications
- Open Access
- 1 January 2024
- Published by EdiUNS - Editorial de la Universidad Nacional del Sur in Latin American Applied Research - An international journal
- Vol. 54 (1) , 133-141
VENDOR MANAGED INVENTORY POLICY FOR PERISHABLE PRODUCTS UNDER A COMBINATION OF FIFO-LIFO STOCK CONTROL
For retailing systems, arranging the perishable products has always been a challenge. Although more profit is made when products are sold with a FIFO policy, now customers taste in a competitive market which requires new products to be offered to them has changed the game. This paper considers a hybrid of FIFO-LIFO strategies for controlling a retailer's stock and its impact on the profits of the vendor managed inventory contracts. The problem is formulated as a multi-period, multi-store integer programming model which aims to maximize the total profit. The proposed model considers different selling prices and different holding costs for perishable products according to their remaining shelf life. A dynamic programming with a backward strategy is proposed to find the optimal order quantity for each store. The numerical experiments confirm the applicability and efficiency of the model illustrating impact of the crucial parameters of the model on the stocking policy.
- 1 January 2024
- Published by EdiUNS - Editorial de la Universidad Nacional del Sur in Latin American Applied Research - An international journal
- Vol. 54 (1) , 133-141
Open AccessVENDOR MANAGED INVENTORY POLICY FOR PERISHABLE PRODUCTS UNDER A COMBINATION OF FIFO-LIFO STOCK CONTROL
For retailing systems, arranging the perishable products has always been a challenge. Although more profit is made when products are sold with a FIFO policy, now customers taste in a competitive market which requires new products to be offered to them has changed the game. This paper considers a hybrid of FIFO-LIFO strategies for controlling a retailer's stock and its impact on the profits of the vendor managed inventory contracts. The problem is formulated as a multi-period, multi-store integer programming model which aims to maximize the total profit. The proposed model considers different selling prices and different holding costs for perishable products according to their remaining shelf life. A dynamic programming with a backward strategy is proposed to find the optimal order quantity for each store. The numerical experiments confirm the applicability and efficiency of the model illustrating impact of the crucial parameters of the model on the stocking policy.
- Open Access
- 28 February 2023
- Published by Frontiers Media SA in International Journal of Public Health
- Vol. 68, 1605015
A Two-Stage Optimization Approach for Healthcare Facility Location- Allocation Problems With Service Delivering Based on Genetic Algorithm
Objective: This study assesses a multi-period capacitated maximal-covering location-allocation model for healthcare services, taking interservice referral as well as equity access into account.Methods: A two-stage optimization strategy is used to formulate the model. In the first stage, facilities are located to maximize covered demand, and in the second stage, patients are allocated to capacitated facilities based on their radius of coverage over multiple time periods. The problem, which belongs to the NP-hard class of optimization problems, is solved using a linear mixed-integer programming (MILP) model.Results: A numerical example is presented to evaluate the efficiency of the proposed model. In addition, to identify near-optimal solutions for large instances, a hybrid genetic-sequential quadratic programming approach (GA-SQP) is developed. To examine the performance and efficiency of the GA-SQP, we employed several randomly generated test instances of various sizes and compared them to those obtained using the exact method.Conclusion: The proposed model has demonstrated an excellent ability in locating healthcare facilities and allocating health services while taking shortage and equity into account during each time period.
- 28 February 2023
- Published by Frontiers Media SA in International Journal of Public Health
- Vol. 68, 1605015
Open AccessA Two-Stage Optimization Approach for Healthcare Facility Location- Allocation Problems With Service Delivering Based on Genetic Algorithm
Objective: This study assesses a multi-period capacitated maximal-covering location-allocation model for healthcare services, taking interservice referral as well as equity access into account.Methods: A two-stage optimization strategy is used to formulate the model. In the first stage, facilities are located to maximize covered demand, and in the second stage, patients are allocated to capacitated facilities based on their radius of coverage over multiple time periods. The problem, which belongs to the NP-hard class of optimization problems, is solved using a linear mixed-integer programming (MILP) model.Results: A numerical example is presented to evaluate the efficiency of the proposed model. In addition, to identify near-optimal solutions for large instances, a hybrid genetic-sequential quadratic programming approach (GA-SQP) is developed. To examine the performance and efficiency of the GA-SQP, we employed several randomly generated test instances of various sizes and compared them to those obtained using the exact method.Conclusion: The proposed model has demonstrated an excellent ability in locating healthcare facilities and allocating health services while taking shortage and equity into account during each time period.
- Open Access
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 20 (7) , 13015-13035
Robust optimization of train scheduling with consideration of response actions to primary and secondary risks
Nowadays, with the rapid development of rail transportation systems, passenger demand and the possibility of the risks occurring in this industry have increased. These conditions cause uncertainty in passenger demand and the development of adverse impacts as a result of risks, which put the assurance of precise planning in jeopardy. To deal with uncertainty and lessen negative impacts, robust optimization of the train scheduling problem in the presence of risks is crucial. A two-stage mixed integer programming model is suggested in this study. In the first stage, the objective of the nominal train scheduling problem is to minimize the total travel time function and optimally determine the decision variables of the train timetables and the number of train stops. A robust optimization model is developed in the second stage with the aim of minimizing unsatisfied demand and reducing passenger dissatisfaction. Additionally, programming is carried out and the set of optimal risk response actions is identified in the proposed approach for the presence of primary and secondary risks in the train scheduling problem. A real-world example is provided to demonstrate the model's effectiveness and to compare the developed models. The results demonstrate that secondary risk plays a significant role in the process of optimal response actions selection. Furthermore, in the face of uncertainty, robust solutions can significantly and effectively minimize unsatisfied demand by a slightly rise in the travel time and the number of stops obtained from the nominal problem.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Mathematical Biosciences and Engineering
- Vol. 20 (7) , 13015-13035
Open AccessRobust optimization of train scheduling with consideration of response actions to primary and secondary risks
Nowadays, with the rapid development of rail transportation systems, passenger demand and the possibility of the risks occurring in this industry have increased. These conditions cause uncertainty in passenger demand and the development of adverse impacts as a result of risks, which put the assurance of precise planning in jeopardy. To deal with uncertainty and lessen negative impacts, robust optimization of the train scheduling problem in the presence of risks is crucial. A two-stage mixed integer programming model is suggested in this study. In the first stage, the objective of the nominal train scheduling problem is to minimize the total travel time function and optimally determine the decision variables of the train timetables and the number of train stops. A robust optimization model is developed in the second stage with the aim of minimizing unsatisfied demand and reducing passenger dissatisfaction. Additionally, programming is carried out and the set of optimal risk response actions is identified in the proposed approach for the presence of primary and secondary risks in the train scheduling problem. A real-world example is provided to demonstrate the model's effectiveness and to compare the developed models. The results demonstrate that secondary risk plays a significant role in the process of optimal response actions selection. Furthermore, in the face of uncertainty, robust solutions can significantly and effectively minimize unsatisfied demand by a slightly rise in the travel time and the number of stops obtained from the nominal problem.
- 24 February 2022
- Published by Elsevier in International Journal of Disaster Risk Reduction
- Vol. 73
Coordinated routing system for fire detection by patrolling trucks with drones
- 24 February 2022
- Published by Elsevier in International Journal of Disaster Risk Reduction
- Vol. 73
Coordinated routing system for fire detection by patrolling trucks with drones
- Open Access
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Coordinated Trucks and Drones for Early Fire Detection
The traditional patrol systems are unable to cover all regions of the forest and pastures due to the difficulty of crossing some routes. This study aims to create a new bi-objective mathematical model for forest fire protection by proposing a new coordinated patrolling system. Drones serve as a useful tool for monitoring impassible areas, while trucks serve as mobile depots for them by considering uncertainty in the time and cost parameters when implementing a scenario generation method. An Accelerated Benders' decomposition (ABD) is developed to find the optimal solution for each scenario. To evaluate the model robustness, risk-averse and min-max relative regret robust optimization approaches are analyzed. Finally, the column and constraint generation (CCG) method, a highly efficient method for solving scenario-based problems, has been developed. The results show that the robust model outperformed the deterministic model in all scenarios. The CCG approach solves the specified risk-averse and min-max relative regret robust optimization models in a reasonable time for large sizes and scenarios. The proposed solution framework is hence capable of optimally planning for any proposed used truck-and-drone coordinated problem.
- 1 January 2022
- Published by Elsevier in SSRN Electronic Journal
Open AccessCoordinated Trucks and Drones for Early Fire Detection
The traditional patrol systems are unable to cover all regions of the forest and pastures due to the difficulty of crossing some routes. This study aims to create a new bi-objective mathematical model for forest fire protection by proposing a new coordinated patrolling system. Drones serve as a useful tool for monitoring impassible areas, while trucks serve as mobile depots for them by considering uncertainty in the time and cost parameters when implementing a scenario generation method. An Accelerated Benders' decomposition (ABD) is developed to find the optimal solution for each scenario. To evaluate the model robustness, risk-averse and min-max relative regret robust optimization approaches are analyzed. Finally, the column and constraint generation (CCG) method, a highly efficient method for solving scenario-based problems, has been developed. The results show that the robust model outperformed the deterministic model in all scenarios. The CCG approach solves the specified risk-averse and min-max relative regret robust optimization models in a reasonable time for large sizes and scenarios. The proposed solution framework is hence capable of optimally planning for any proposed used truck-and-drone coordinated problem.
- 21 October 2021
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 40 (8) , 1-38
A simple empirical inventory model for managing the processed corneal tissue equitably in hospitals with demand differentiation
This paper peruses one of the most challenging healthcare concerns related to human organ transplantation. In this regard, a medical system’s health-economic objectives are investigated to (1) achieve a desirable level of health equity in offering healthcare services to patients who are differentiated in terms of medical conditions, and (2) minimize total costs incurred across managing the inventory. This paper presents the first-ever operational research study to manage processed corneal tissue (PCT). Besides, hybrid demand-oriented policies have been proposed to equitably issue and assign specific inventories to demands with distinct medical urgent levels (ULs). In this regard, a practical multi-objective mixed-integer linear programming (MOMILP) model is proposed for a system with multiple products that can be substituted with each other according to medical priorities. A goal programming (GP) approach is utilized to find the optimum solution. The applicability of the model is validated through a real case study. Finally, several sensitivity analyses are conducted to examine the effect of critical parameters on the solutions to gain useful managerial insights. The results show that the proposed health-economic trade-off is well performed and can efficiently handle the real case.
- 21 October 2021
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 40 (8) , 1-38
A simple empirical inventory model for managing the processed corneal tissue equitably in hospitals with demand differentiation
This paper peruses one of the most challenging healthcare concerns related to human organ transplantation. In this regard, a medical system’s health-economic objectives are investigated to (1) achieve a desirable level of health equity in offering healthcare services to patients who are differentiated in terms of medical conditions, and (2) minimize total costs incurred across managing the inventory. This paper presents the first-ever operational research study to manage processed corneal tissue (PCT). Besides, hybrid demand-oriented policies have been proposed to equitably issue and assign specific inventories to demands with distinct medical urgent levels (ULs). In this regard, a practical multi-objective mixed-integer linear programming (MOMILP) model is proposed for a system with multiple products that can be substituted with each other according to medical priorities. A goal programming (GP) approach is utilized to find the optimum solution. The applicability of the model is validated through a real case study. Finally, several sensitivity analyses are conducted to examine the effect of critical parameters on the solutions to gain useful managerial insights. The results show that the proposed health-economic trade-off is well performed and can efficiently handle the real case.
- 22 June 2021
- Published by CMV Verlag in Journal of Industrial Management Perspective
- Vol. 11 (2) , 41-66
Modeling and Solving the Cross-Docking Centers Location and Vehicle Scheduling Problem in a Multi-Product Supply Chain with Discrete Pick-up and Delivery
در این پژوهش مسائل مکانیابی انبارهای متقاطع، مسیریابی و زمانبندی وسایل نقلیه را بهطور همزمان در یک زنجیره تأمین سهسطحی با امکان برداشت و تحویل گسسته، با هدف کمینهسازی مجموع هزینهها (هزینه احداث انبارهای متقاطع، هزینههای ثابت و متغیر حملونقل و جریمه تأخیر و تعجیل)، موردمطالعه قرار گرفته و یک مدل برنامهریزی ترکیبی عدد صحیح غیرخطی برای آن ارائه شده است. در این مدل تصمیمگیری در خصوص تخصیص وسایل نقلیه ناهمگن به فرآیند برداشت و تحویل و انتخاب مکان و تعداد انبارهای متقاطع برای احداث از میان مکانهای بالقوه موجود پس از حل مدل صورت میگیرد. فرض چندمحصولیبودن شامل تکتک تأمینکنندگان، انبارهای متقاطع و مشتریان میشود. برای تحویل هر نوع از کالاها در محل هر یک از مشتریان یک پنجره زمانی نرم در نظر گرفته شده است و علاوه بر جریمه تأخیر، جریمه تعجیل در تحویل کالاها متناسب با مدتزمان و مقدار کالای مواجهشده با تأخیر/ تعجیل محاسبه میشود. سه دسته مسئله در ابعاد کوچک، متوسط و بزرگ بهصورت تصادفی تولید و با استفاده از الگوریتم شبیهسازی تبرید حل شدهاند. برای مسائل کوچک، جواب حاصل از روشهای حل دقیق با نتایج...
- 22 June 2021
- Published by CMV Verlag in Journal of Industrial Management Perspective
- Vol. 11 (2) , 41-66
Modeling and Solving the Cross-Docking Centers Location and Vehicle Scheduling Problem in a Multi-Product Supply Chain with Discrete Pick-up and Delivery
در این پژوهش مسائل مکانیابی انبارهای متقاطع، مسیریابی و زمانبندی وسایل نقلیه را بهطور همزمان در یک زنجیره تأمین سهسطحی با امکان برداشت و تحویل گسسته، با هدف کمینهسازی مجموع هزینهها (هزینه احداث انبارهای متقاطع، هزینههای ثابت و متغیر حملونقل و جریمه تأخیر و تعجیل)، موردمطالعه قرار گرفته و یک مدل برنامهریزی ترکیبی عدد صحیح غیرخطی برای آن ارائه شده است. در این مدل تصمیمگیری در خصوص تخصیص وسایل نقلیه ناهمگن به فرآیند برداشت و تحویل و انتخاب مکان و تعداد انبارهای متقاطع برای احداث از میان مکانهای بالقوه موجود پس از حل مدل صورت میگیرد. فرض چندمحصولیبودن شامل تکتک تأمینکنندگان، انبارهای متقاطع و مشتریان میشود. برای تحویل هر نوع از کالاها در محل هر یک از مشتریان یک پنجره زمانی نرم در نظر گرفته شده است و علاوه بر جریمه تأخیر، جریمه تعجیل در تحویل کالاها متناسب با مدتزمان و مقدار کالای مواجهشده با تأخیر/ تعجیل محاسبه میشود. سه دسته مسئله در ابعاد کوچک، متوسط و بزرگ بهصورت تصادفی تولید و با استفاده از الگوریتم شبیهسازی تبرید حل شدهاند. برای مسائل کوچک، جواب حاصل از روشهای حل دقیق با نتایج...
- 16 March 2021
- Published by Springer Nature in Operational Research
- Vol. 22 (3) , 2245-2280
A bi-objective model for scheduling of multiple projects under multi-skilled workforce for distributed load energy usage
- 16 March 2021
- Published by Springer Nature in Operational Research
- Vol. 22 (3) , 2245-2280
A bi-objective model for scheduling of multiple projects under multi-skilled workforce for distributed load energy usage
- Open Access
- 31 January 2021
- Published by The Korean Society of Medical Informatics in Healthcare Informatics Research
- Vol. 27 (1) , 73-81
Dynamic Demand-Centered Process-Oriented Data Model for Inventory Management of Hemovigilance Systems
Identification, analysis, and representation of the blood bank’s general inventory management process and depicting its main components. The weaknesses of the current system in meeting user requirements are identified in this step. This step is conducted through observation and interviewing of members involved in blood transfusion at the central blood bank and the hospital blood bank. In our case study, 10 participants were selected by sampling to achieve representativeness or comparability through the typical case sampling method [15];
- 31 January 2021
- Published by The Korean Society of Medical Informatics in Healthcare Informatics Research
- Vol. 27 (1) , 73-81
Open AccessDynamic Demand-Centered Process-Oriented Data Model for Inventory Management of Hemovigilance Systems
Identification, analysis, and representation of the blood bank’s general inventory management process and depicting its main components. The weaknesses of the current system in meeting user requirements are identified in this step. This step is conducted through observation and interviewing of members involved in blood transfusion at the central blood bank and the hospital blood bank. In our case study, 10 participants were selected by sampling to achieve representativeness or comparability through the typical case sampling method [15];