Pooya Hoseinpour
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Pooya Hoseinpour has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Amir Ahmadi-Javid
Department of Industrial Engineering & Management Systems, Amirkabir University of Technology, Tehran, Iran
2 shared publications - Ata Jalili Marand
Department of Economics and Business Economics, Aarhus University, Aarhus V, Denmark
2 shared publications - Melika Khandan
Department of Industrial Engineering & Management Systems, Amirkabir University of Technology (Tehran Polytechnic), Tehran 1591634311, Iran
2 shared publications Mohammadreza Kiaghadi
Amirkabir University of Technology (Tehran Polytechnic)
2 shared publicationsAtiyeh Modirkhorasani
1 shared publicationBeste Kucukyazici
Queen’s University - Kingston Campus, Kingston, Canada
1 shared publication
Latest Publications
- 18 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Service Science
Nurse Workload Balancing in a Surgical Ward using Data-Driven Inverse Optimization
Sustained inequities in workload distribution can lead to increased stress, reduced job satisfaction, high turnover, and nursing shortages. Consequently, healthcare quality may also suffer from persistent imbalances in nursing workload. We develop a data-driven analytical framework to improve workload balance by optimizing nurse–patient assignment decisions at the beginning of each shift. To this end, we use an extensive dataset collected by a real-time location system installed in the surgical services department of a large tertiary hospital. The nurse workload is modelled as a multi-attribute function that incorporates the number of assigned patients, travel distance, and direct care time. The relative importance of these attributes is elicited from historical assignment decisions using a data-driven inverse-optimization procedure and subsequently translated into assignment rules via clustering. These rules are then incorporated into a robust nurse workload-balancing model to generate nurse–patient assignments for upcoming shifts, accounting for uncertainty in workload preferences. In the surgical ward we studied, the proposed approach reduces the maximum travel distance by 50%–77%. In addition, the average ranges of total direct care time, maximum travel distance, and number of assigned patients decrease by 65%, 45%, and 31%, respectively.
- 18 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Service Science
Nurse Workload Balancing in a Surgical Ward using Data-Driven Inverse Optimization
Sustained inequities in workload distribution can lead to increased stress, reduced job satisfaction, high turnover, and nursing shortages. Consequently, healthcare quality may also suffer from persistent imbalances in nursing workload. We develop a data-driven analytical framework to improve workload balance by optimizing nurse–patient assignment decisions at the beginning of each shift. To this end, we use an extensive dataset collected by a real-time location system installed in the surgical services department of a large tertiary hospital. The nurse workload is modelled as a multi-attribute function that incorporates the number of assigned patients, travel distance, and direct care time. The relative importance of these attributes is elicited from historical assignment decisions using a data-driven inverse-optimization procedure and subsequently translated into assignment rules via clustering. These rules are then incorporated into a robust nurse workload-balancing model to generate nurse–patient assignments for upcoming shifts, accounting for uncertainty in workload preferences. In the surgical ward we studied, the proposed approach reduces the maximum travel distance by 50%–77%. In addition, the average ranges of total direct care time, maximum travel distance, and number of assigned patients decrease by 65%, 45%, and 31%, respectively.
- 25 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Incorporating Promotional Effects in Sales Planning of the Retail Industry Using Geometric Programming
This directory contains all the instances and results in both Numerical Experiments and Case Study Sections in the paper.
- 25 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Incorporating Promotional Effects in Sales Planning of the Retail Industry Using Geometric Programming
This directory contains all the instances and results in both Numerical Experiments and Case Study Sections in the paper.
- 25 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Incorporating Promotional Effects in Sales Planning of the Retail Industry Using Geometric Programming
This paper addresses the challenge faced by managers in the fast-moving consumer goods industry: the joint optimization of promotion prices and the scheduling of promotion vehicles for multiple items to boost total profit. We first propose a general multiplicative demand function that encompasses all crossperiod effects, crossitem effects, promotion vehicle effects, and crossterm effects of promotion vehicles. Then, we formulate the problem of planning sales promotions, simultaneously using price reductions and promotion vehicles, considering several business rules as constraints. To efficiently solve this mixed-integer nonlinear program, we reformulate it as a convex optimization form by using the demand function’s multiplicative structure and the concept of geometric programming. Furthermore, to reduce the running time of the large-scale instances, we develop a Lagrangian decomposition algorithm, dividing the original model into a geometric program and an integer program. The algorithm significantly improves computational efficiency as evidenced by a reduction in running time from 8,125 to 78 seconds for large-scale instances. Finally, utilizing real sales data from a meal delivery company, we demonstrate that applying the convex promotion optimization model allows the company to increase its profits by roughly 21% compared with scenarios where neither price reductions nor promotion vehicles are utilized. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0275 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0275 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 25 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Incorporating Promotional Effects in Sales Planning of the Retail Industry Using Geometric Programming
This paper addresses the challenge faced by managers in the fast-moving consumer goods industry: the joint optimization of promotion prices and the scheduling of promotion vehicles for multiple items to boost total profit. We first propose a general multiplicative demand function that encompasses all crossperiod effects, crossitem effects, promotion vehicle effects, and crossterm effects of promotion vehicles. Then, we formulate the problem of planning sales promotions, simultaneously using price reductions and promotion vehicles, considering several business rules as constraints. To efficiently solve this mixed-integer nonlinear program, we reformulate it as a convex optimization form by using the demand function’s multiplicative structure and the concept of geometric programming. Furthermore, to reduce the running time of the large-scale instances, we develop a Lagrangian decomposition algorithm, dividing the original model into a geometric program and an integer program. The algorithm significantly improves computational efficiency as evidenced by a reduction in running time from 8,125 to 78 seconds for large-scale instances. Finally, utilizing real sales data from a meal delivery company, we demonstrate that applying the convex promotion optimization model allows the company to increase its profits by roughly 21% compared with scenarios where neither price reductions nor promotion vehicles are utilized. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0275 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2023.0275 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- Open Access
- 13 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 442-456
A congested facility location problem with strategic customers
- 13 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 442-456
Open AccessA congested facility location problem with strategic customers
- 6 January 2024
- Published by Elsevier in Socio-Economic Planning Sciences
- Vol. 92
Decentralized exam timetabling: A solution for conducting exams during pandemics
- 6 January 2024
- Published by Elsevier in Socio-Economic Planning Sciences
- Vol. 92
Decentralized exam timetabling: A solution for conducting exams during pandemics
- 1 September 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 34 (5) , 2621-2633
Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion
Mixed-integer second-order cone programs (MISOCPs) form a novel class of mixed-integer convex programs, which can be solved very efficiently as a result of the recent advances in optimization solvers. This paper shows how various performance metrics of M/G/1 queues can be modeled by different MISOCPs. To motivate the reformulation method, it is first applied to a challenging stochastic location problem with congestion, which is broadly used to design socially optimal service systems. Three different MISOCPs are developed and compared on different sets of benchmark test problems. The new formulations efficiently solve very large-size test problems that cannot be solved by the two existing methods developed based on linear programming within reasonable time. The superiority of the conic reformulation method is next shown over a state-space decomposition method recently used to solve an assignment problem in queueing systems. Finally, the general applicability of the method is shown for similar optimization problems that use queue-theoretic performance measures to address customer satisfaction and service quality.
- 1 September 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 34 (5) , 2621-2633
Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion
Mixed-integer second-order cone programs (MISOCPs) form a novel class of mixed-integer convex programs, which can be solved very efficiently as a result of the recent advances in optimization solvers. This paper shows how various performance metrics of M/G/1 queues can be modeled by different MISOCPs. To motivate the reformulation method, it is first applied to a challenging stochastic location problem with congestion, which is broadly used to design socially optimal service systems. Three different MISOCPs are developed and compared on different sets of benchmark test problems. The new formulations efficiently solve very large-size test problems that cannot be solved by the two existing methods developed based on linear programming within reasonable time. The superiority of the conic reformulation method is next shown over a state-space decomposition method recently used to solve an assignment problem in queueing systems. Finally, the general applicability of the method is shown for similar optimization problems that use queue-theoretic performance measures to address customer satisfaction and service quality.
- 19 August 2022
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 56 (1) , 233-256
University admission process: a prescriptive analytics approach
- 19 August 2022
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 56 (1) , 233-256
University admission process: a prescriptive analytics approach
- 18 August 2022
- Published by Wiley in International Transactions in Operational Research
- Vol. 31 (3) , 1975-1993
Modeling and solving an economies‐of‐scale service system design problem
This paper studies the design of a service system in the presence of economies of scale (EoS). The goal is to decide on the number, location, service capacities of facilities, and the allocation of customers to the opened facilities to minimize the total cost of the system. The total cost includes the opening and serving costs of facilities as well as customers' transportation and waiting costs. To reflect the EoS in the modeling, a general opening cost function is assumed for each service facility with the characteristic of being concave and nondecreasing in its service capacity. A Lagrangian relaxation algorithm is developed for solving the problem in its general form. The algorithm decomposes the relaxed model into homogeneous subproblems where each one can be optimally solved in polynomial time with no need for an optimization solver. Furthermore, the optimal service capacity of each open facility is determined as a closed‐form function. Our computational experiment shows that the developed algorithm is both efficient and effective in solving the proposed problem.
- 18 August 2022
- Published by Wiley in International Transactions in Operational Research
- Vol. 31 (3) , 1975-1993
Modeling and solving an economies‐of‐scale service system design problem
This paper studies the design of a service system in the presence of economies of scale (EoS). The goal is to decide on the number, location, service capacities of facilities, and the allocation of customers to the opened facilities to minimize the total cost of the system. The total cost includes the opening and serving costs of facilities as well as customers' transportation and waiting costs. To reflect the EoS in the modeling, a general opening cost function is assumed for each service facility with the characteristic of being concave and nondecreasing in its service capacity. A Lagrangian relaxation algorithm is developed for solving the problem in its general form. The algorithm decomposes the relaxed model into homogeneous subproblems where each one can be optimally solved in polynomial time with no need for an optimization solver. Furthermore, the optimal service capacity of each open facility is determined as a closed‐form function. Our computational experiment shows that the developed algorithm is both efficient and effective in solving the proposed problem.