Iman Dayarian
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
Research Subjects
Iman Dayarian has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
Michel Gendreau
3 shared publicationsWalter Rei
3 shared publicationsHadi Charkhgard
University of South Florida
2 shared publications- Hadi Charkhgard
University of South Florida
2 shared publications - Jennifer Ann Pazour
Department of Industrial and Systems Engineering, Rensselaer Polytechnic Institute, Troy, New York 12180
2 shared publications - Martin Savelsbergh
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
2 shared publications
Latest Publications
- 9 March 2026
- Published by SAGE Publications in Production and Operations Management
- Vol. 35 (8) , 3180-3203
Equity-Driven Workload Allocation for Crowdsourced Last-Mile Delivery
Crowdshipping, a rapidly growing approach in Last-Mile Delivery (LMD), relies on independent crowdworkers to fulfill delivery orders. Building a sustainable network of crowdshippers is crucial for the long-term success of such systems, as participation is primarily driven by fair compensation. This is especially important for workers who rely on crowdwork as their main source of income, making equitable pay not just a matter of fairness but of financial well-being. In this study, we address several key questions that gig-economy platforms concerned with fair pay may ask: How can equity be measured? What are the associated cost implications? And how can potential drawbacks be managed? Our main contribution is the development of a practical, equity-oriented framework tailored to crowdshipping within an LMD environment. Inspired by the real-world operations of several crowdshipping platforms, the framework operates in real time and is built around a bi-objective optimization model that balances equity and cost. This allows us to systematically explore trade-offs and identify the equity measures that most effectively capture this balance. We demonstrate that even a modest reduction in cost efficiency (e.g., 2.5%) can lead to substantial improvements in equity; potentially up to 65%. Our results provide actionable insights for practitioners, including guidance on selecting appropriate equity measures. We also find that the best equity outcomes occur when the crowdshipper pool is kept relatively small. Furthermore, we quantify the performance loss of high- and low-performing crowdshippers as the pool size increases, offering valuable insights for workforce planning and management. Along similar lines, we demonstrate that our framework remains effective in managing vehicle shortages in dynamic environments while achieving comparable levels of equity improvement.
- 9 March 2026
- Published by SAGE Publications in Production and Operations Management
- Vol. 35 (8) , 3180-3203
Equity-Driven Workload Allocation for Crowdsourced Last-Mile Delivery
Crowdshipping, a rapidly growing approach in Last-Mile Delivery (LMD), relies on independent crowdworkers to fulfill delivery orders. Building a sustainable network of crowdshippers is crucial for the long-term success of such systems, as participation is primarily driven by fair compensation. This is especially important for workers who rely on crowdwork as their main source of income, making equitable pay not just a matter of fairness but of financial well-being. In this study, we address several key questions that gig-economy platforms concerned with fair pay may ask: How can equity be measured? What are the associated cost implications? And how can potential drawbacks be managed? Our main contribution is the development of a practical, equity-oriented framework tailored to crowdshipping within an LMD environment. Inspired by the real-world operations of several crowdshipping platforms, the framework operates in real time and is built around a bi-objective optimization model that balances equity and cost. This allows us to systematically explore trade-offs and identify the equity measures that most effectively capture this balance. We demonstrate that even a modest reduction in cost efficiency (e.g., 2.5%) can lead to substantial improvements in equity; potentially up to 65%. Our results provide actionable insights for practitioners, including guidance on selecting appropriate equity measures. We also find that the best equity outcomes occur when the crowdshipper pool is kept relatively small. Furthermore, we quantify the performance loss of high- and low-performing crowdshippers as the pool size increases, offering valuable insights for workforce planning and management. Along similar lines, we demonstrate that our framework remains effective in managing vehicle shortages in dynamic environments while achieving comparable levels of equity improvement.
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (2) , 316-342
A Branch-and-Benders Cut Algorithm for a Stochastic Service Network Design with Crowdsourced Capacity
We explore the stochastic service network design problem of an intracity courier service provider. To efficiently fulfill delivery tasks, the courier company employs a hybrid fleet consisting of contracted drivers, crowdshippers, and third-party drivers based on a planning framework that takes into account uncertainty in terms of demand and transportation capacity offered by crowdshippers. At the tactical level and taking into account future demand and crowdshipper capacity estimations, the courier company acquires transportation capacity through the forward market at a relatively low rate. At the operational level, however, once the demand and the available crowdshipper capacity are revealed, the courier company may supplement the existing transportation capacity by acquiring through the spot market and/or by employing crowdshippers. We model the problem at the tactical level as a two-stage stochastic problem with integer variables in both stages and develop a branch-and-Benders-cut with partial Benders decomposition approach to solve the model. In our solution framework, we incorporate the classical Benders decomposition, integer L-shaped method, and Benders dual decomposition to generate different types of optimality cuts. To improve the efficiency of our method, we employ accelerating strategies such as selective subproblems, parallelism, and [ ]-optimality. Further, to study the effect of possible plan revisions, we propose a partially adaptive stochastic programming approach that allows for a limited number of tactical-level plan adjustments given the extra information revealed at the operational phase. We quantify the benefits of such updates and evaluate the effect of the frequencies at which such updates are performed.
- 1 March 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (2) , 316-342
A Branch-and-Benders Cut Algorithm for a Stochastic Service Network Design with Crowdsourced Capacity
We explore the stochastic service network design problem of an intracity courier service provider. To efficiently fulfill delivery tasks, the courier company employs a hybrid fleet consisting of contracted drivers, crowdshippers, and third-party drivers based on a planning framework that takes into account uncertainty in terms of demand and transportation capacity offered by crowdshippers. At the tactical level and taking into account future demand and crowdshipper capacity estimations, the courier company acquires transportation capacity through the forward market at a relatively low rate. At the operational level, however, once the demand and the available crowdshipper capacity are revealed, the courier company may supplement the existing transportation capacity by acquiring through the spot market and/or by employing crowdshippers. We model the problem at the tactical level as a two-stage stochastic problem with integer variables in both stages and develop a branch-and-Benders-cut with partial Benders decomposition approach to solve the model. In our solution framework, we incorporate the classical Benders decomposition, integer L-shaped method, and Benders dual decomposition to generate different types of optimality cuts. To improve the efficiency of our method, we employ accelerating strategies such as selective subproblems, parallelism, and [ ]-optimality. Further, to study the effect of possible plan revisions, we propose a partially adaptive stochastic programming approach that allows for a limited number of tactical-level plan adjustments given the extra information revealed at the operational phase. We quantify the benefits of such updates and evaluate the effect of the frequencies at which such updates are performed.
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (1) , 22-45
The k -Traveling Repairman Problem with Stochastic Service Request Times
The traveling repairman problem focuses on minimizing total latency, defined as the waiting time experienced by customers after submitting a service request. This problem naturally arises in settings where customer experience is a key objective, particularly in time-sensitive service operations. We address a generalized traveling repairman problem that extends the classical setting by incorporating available probabilistic information on the timing of future requests as well as a more flexible method for measuring the impact of service latency. To account for potential future requests in addition to those known at the time of route planning, we develop a priori routes combined with recourse rules for their execution, aiming to minimize the total expected disutility caused by service latency across all customers. We formulate the problem as a stochastic, path-based traveling repairman problem and solve it using a branch-and-price algorithm, where expected latency is estimated through sample-scenario planning. We then evaluate the performance of our a priori routing approach through a factorial experiment; compare it with alternative routing strategies; and apply these methods to a large-scale, real-world bike-sharing setting. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0478 .
- 1 January 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 60 (1) , 22-45
The k -Traveling Repairman Problem with Stochastic Service Request Times
The traveling repairman problem focuses on minimizing total latency, defined as the waiting time experienced by customers after submitting a service request. This problem naturally arises in settings where customer experience is a key objective, particularly in time-sensitive service operations. We address a generalized traveling repairman problem that extends the classical setting by incorporating available probabilistic information on the timing of future requests as well as a more flexible method for measuring the impact of service latency. To account for potential future requests in addition to those known at the time of route planning, we develop a priori routes combined with recourse rules for their execution, aiming to minimize the total expected disutility caused by service latency across all customers. We formulate the problem as a stochastic, path-based traveling repairman problem and solve it using a branch-and-price algorithm, where expected latency is estimated through sample-scenario planning. We then evaluate the performance of our a priori routing approach through a factorial experiment; compare it with alternative routing strategies; and apply these methods to a large-scale, real-world bike-sharing setting. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0478 .
- 30 November 2025
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 206
Strategic design of parcel locker networks for urban delivery
- 30 November 2025
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 206
Strategic design of parcel locker networks for urban delivery
- 8 May 2025
- Published by Taylor & Francis in IISE Transactions
- Vol. 58 (3) , 272-289
Store fulfillment with autonomous mobile robots and in-store customers
- 8 May 2025
- Published by Taylor & Francis in IISE Transactions
- Vol. 58 (3) , 272-289
Store fulfillment with autonomous mobile robots and in-store customers
- 12 February 2025
- Published by SAGE Publications in Production and Operations Management
- Vol. 34 (7) , 1875-1900
Equitable Workload Allocation in Vehicle Routing Problem With Heterogeneous Drivers
In the private logistics service sector, considerations of fairness among service agents are relatively new but are gaining importance due to public and governmental pressures to improve equity in workload allocation among internal stakeholders, such as the service personnel. Fairness becomes more complex in settings with a heterogeneous workforce due to inherent worker differences. In this study, we present an equitable workload allocation model for the vehicle routing problem with heterogeneous drivers. We adopt the Nash Social Welfare (NSW) solution as the focal point for coalition among the various drivers. In our setup, while the ultimate goal is to maximize the equity and efficiency of drivers, the company’s efficiency is guaranteed by putting a cap on the deviation of the company’s cost from the least-cost solution value. We formulate the problem of last-mile delivery of online orders from a store using a fleet of crowdshippers as a variant of the vehicle routing problem with a highly nonlinear objective function inspired by NSW’s objective function. To solve the proposed new formulation, a column generation method is developed and used to study the behavior of the model. Through a comprehensive computational study, we investigate the behavior of the system in terms of the company’s cost, drivers’ total profit, and the level of achieved equity among the drivers when the main parameters of the problem vary. Our study demonstrates that the proposed framework outperforms the classical max–min approach in balancing workload equity and efficiency. We show a median equity improvement of 18% with a 5% cost deviation and 30% with a 10% deviation from the least-cost solution.
- 12 February 2025
- Published by SAGE Publications in Production and Operations Management
- Vol. 34 (7) , 1875-1900
Equitable Workload Allocation in Vehicle Routing Problem With Heterogeneous Drivers
In the private logistics service sector, considerations of fairness among service agents are relatively new but are gaining importance due to public and governmental pressures to improve equity in workload allocation among internal stakeholders, such as the service personnel. Fairness becomes more complex in settings with a heterogeneous workforce due to inherent worker differences. In this study, we present an equitable workload allocation model for the vehicle routing problem with heterogeneous drivers. We adopt the Nash Social Welfare (NSW) solution as the focal point for coalition among the various drivers. In our setup, while the ultimate goal is to maximize the equity and efficiency of drivers, the company’s efficiency is guaranteed by putting a cap on the deviation of the company’s cost from the least-cost solution value. We formulate the problem of last-mile delivery of online orders from a store using a fleet of crowdshippers as a variant of the vehicle routing problem with a highly nonlinear objective function inspired by NSW’s objective function. To solve the proposed new formulation, a column generation method is developed and used to study the behavior of the model. Through a comprehensive computational study, we investigate the behavior of the system in terms of the company’s cost, drivers’ total profit, and the level of achieved equity among the drivers when the main parameters of the problem vary. Our study demonstrates that the proposed framework outperforms the classical max–min approach in balancing workload equity and efficiency. We show a median equity improvement of 18% with a 5% cost deviation and 30% with a 10% deviation from the least-cost solution.
- 24 December 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 192
Solving the equity-aware dial-a-ride problem using an exact branch-cut-and-price algorithm
- 24 December 2024
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 192
Solving the equity-aware dial-a-ride problem using an exact branch-cut-and-price algorithm
- Open Access
A branch-cut-and-price algorithm for a dial-a-ride problem with minimum disease-transmission risk
This paper investigates a variant of the dial-a-ride problem (DARP), namely Risk-aware DARP (RDARP). Our RDARP extends the DARP by (1) minimizing a weighted sum of travel cost and disease-transmission risk exposure for onboard passengers and (2) introducing a maximum cumulative exposure risk constraint for each vehicle to ensure a trip with lower external exposure. Both extensions require that the risk exposure of each onboard passenger is propagated in a minimized fashion while satisfying other existing constraints of the DARP. To fully describe the RDARP, we first provide a three-index arc-based formulation and reformulate the RDARP into an equivalent min-max trip-based formulation, which is solved by an exact Branch-Cut-and-Price (BCP) algorithm. For each node in the branching tree, we adopt the column generation method by decomposing the problem into a master problem and a subproblem. The latter takes the form of an elementary shortest path problem with resource constraints and minimized maximum risk (ESPPRCMMR). To solve the ESPPRCMMR efficiently, we develop a new labeling algorithm and establish families of resource extension functions in compliance with the risk-related resources. We adopt a real-world paratransit trip dataset to generate the RDARP instances ranging from 17 to 55 heterogeneous passengers with 3 to 13 vehicles during the morning and afternoon periods. Computational results show that our BCP algorithm can optimally solve all small- and medium-sized instances (32 or fewer passengers) within 5 minutes. For the large instances (39 to 55 passengers), our BCP algorithm can solve 23 of 30 instances optimally within a time limit of one hour.
Open AccessA branch-cut-and-price algorithm for a dial-a-ride problem with minimum disease-transmission risk
This paper investigates a variant of the dial-a-ride problem (DARP), namely Risk-aware DARP (RDARP). Our RDARP extends the DARP by (1) minimizing a weighted sum of travel cost and disease-transmission risk exposure for onboard passengers and (2) introducing a maximum cumulative exposure risk constraint for each vehicle to ensure a trip with lower external exposure. Both extensions require that the risk exposure of each onboard passenger is propagated in a minimized fashion while satisfying other existing constraints of the DARP. To fully describe the RDARP, we first provide a three-index arc-based formulation and reformulate the RDARP into an equivalent min-max trip-based formulation, which is solved by an exact Branch-Cut-and-Price (BCP) algorithm. For each node in the branching tree, we adopt the column generation method by decomposing the problem into a master problem and a subproblem. The latter takes the form of an elementary shortest path problem with resource constraints and minimized maximum risk (ESPPRCMMR). To solve the ESPPRCMMR efficiently, we develop a new labeling algorithm and establish families of resource extension functions in compliance with the risk-related resources. We adopt a real-world paratransit trip dataset to generate the RDARP instances ranging from 17 to 55 heterogeneous passengers with 3 to 13 vehicles during the morning and afternoon periods. Computational results show that our BCP algorithm can optimally solve all small- and medium-sized instances (32 or fewer passengers) within 5 minutes. For the large instances (39 to 55 passengers), our BCP algorithm can solve 23 of 30 instances optimally within a time limit of one hour.
- 1 November 2022
- Published by SAGE Publications in Production and Operations Management
- Vol. 31 (11) , 4075-4094
Crowdsourced order‐fulfillment policies using in‐store customers
Omni‐channel services, such as buy‐online‐pick‐up‐from‐store, transfer the in‐store logistics once completed by shoppers to retailers. To cost‐effectively meet the high demands for such pickup services, we introduce a crowdsourced order‐fulfillment policy that deploys in‐store customers to pick items for online orders while completing their own personal shopping. As opposed to existing store fulfillment policies, this new concept utilizes in‐store customers to help, not constrain, dedicated pickers. Empirical data indicate that a high percentage of surveyed in‐store shoppers would be willing to occasionally participate in such a program. In‐store customers willing to participate were observed to be heterogeneous in their efforts, with variability in how much extra time they would be willing to provide and would prefer picking tasks that had only a small deviation from their personal shopping. Motivated by these empirical results, the decision problem of how to assign picking tasks for arriving online orders with a given service commitment, to a set of arriving in‐store customers or an abundant set of dedicated pickers, was formalized to capture the uncertainty and heterogeneity of using in‐store customers for in‐store picking tasks. We propose a tractable decision‐making methodology to determine whether an order will meet both service commitment feasibility and in‐store customer availability with a probability at least equal to a target threshold. This method captures dynamic order placements and in‐store customer arrivals and stochasticity in in‐store customers' shopping baskets. Extensive computational experiments for varying operational conditions of a grocery store dynamically matching actual online orders to arriving in‐store customers helps answer open questions from practitioners. Compensating in‐store customers based on their additional efforts reduced costs of fulfillment by greater than 30%, on average, compared to a baseline that uses only dedicated pickers for store fulfillment. Using the past five shopping baskets of participating in‐store customers to estimate assignment decisions can achieve both high online order service commitments and in‐store customer availability requirements. Our results suggest that in‐store customers should be assigned smaller orders than dedicated pickers.
- 1 November 2022
- Published by SAGE Publications in Production and Operations Management
- Vol. 31 (11) , 4075-4094
Crowdsourced order‐fulfillment policies using in‐store customers
Omni‐channel services, such as buy‐online‐pick‐up‐from‐store, transfer the in‐store logistics once completed by shoppers to retailers. To cost‐effectively meet the high demands for such pickup services, we introduce a crowdsourced order‐fulfillment policy that deploys in‐store customers to pick items for online orders while completing their own personal shopping. As opposed to existing store fulfillment policies, this new concept utilizes in‐store customers to help, not constrain, dedicated pickers. Empirical data indicate that a high percentage of surveyed in‐store shoppers would be willing to occasionally participate in such a program. In‐store customers willing to participate were observed to be heterogeneous in their efforts, with variability in how much extra time they would be willing to provide and would prefer picking tasks that had only a small deviation from their personal shopping. Motivated by these empirical results, the decision problem of how to assign picking tasks for arriving online orders with a given service commitment, to a set of arriving in‐store customers or an abundant set of dedicated pickers, was formalized to capture the uncertainty and heterogeneity of using in‐store customers for in‐store picking tasks. We propose a tractable decision‐making methodology to determine whether an order will meet both service commitment feasibility and in‐store customer availability with a probability at least equal to a target threshold. This method captures dynamic order placements and in‐store customer arrivals and stochasticity in in‐store customers' shopping baskets. Extensive computational experiments for varying operational conditions of a grocery store dynamically matching actual online orders to arriving in‐store customers helps answer open questions from practitioners. Compensating in‐store customers based on their additional efforts reduced costs of fulfillment by greater than 30%, on average, compared to a baseline that uses only dedicated pickers for store fulfillment. Using the past five shopping baskets of participating in‐store customers to estimate assignment decisions can achieve both high online order service commitments and in‐store customer availability requirements. Our results suggest that in‐store customers should be assigned smaller orders than dedicated pickers.