Karmel S. Shehadeh

Dr. Karmel S. Shehadeh


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 September 2022 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
KSKarmel S. Shehadeh
Karmel S. Shehadeh
ETEmily L. Tucker
Emily L. Tucker

1 May 2021 in European Journal of Operational Research
Verified
Journal Article
Closed access
KSKarmel S. Shehadeh
Karmel S. Shehadeh
RPRema Padman
Rema Padman

9 December 2022 in Operations Research Letters
Verified
Journal Article
Closed access
MTMan Yiu Tsang
Man Yiu Tsang
KSKarmel S. Shehadeh
Karmel S. Shehadeh
FCFrank E. Curtis
Frank E. Curtis


1 June 2020 in European Journal of Operational Research
Verified
Journal Article
Closed access
KSKarmel S. Shehadeh
Karmel S. Shehadeh
ACAmy E.M. Cohn
Amy E.M. Cohn
RJRuiwei Jiang
Ruiwei Jiang

1 January 2023 in Transportation Science
Verified
Journal Article
Closed access
KSKarmel S. Shehadeh
Karmel S. Shehadeh
We propose two distributionally robust optimization (DRO) models for a mobile facility (MF) fleet-sizing, routing, and scheduling problem (MFRSP) with time-dependent and random demand as well as methodologies for solving these models. Specifically, given a set of MFs, a planning horizon, and a service region, our models aim to find the number of MFs to use (i.e., fleet size) within the planning horizon and a route and time schedule for each MF in the fleet. The objective is to minimize the fixed cost of establishing the MF fleet plus a risk measure (expectation or mean conditional value at risk) of the operational cost over all demand distributions defined by an ambiguity set. In the first model, we use an ambiguity set based on the demand’s mean, support, and mean absolute deviation. In the second model, we use an ambiguity set that incorporates all distributions within a 1-Wasserstein distance from a reference distribution. To solve the proposed DRO models, we propose a decomposition-based algorithm. In addition, we derive valid lower bound inequalities that efficiently strengthen the master problem in the decomposition algorithm, thus improving convergence. We also derive two families of symmetry-breaking constraints that improve the solvability of the proposed models. Finally, we present extensive computational experiments comparing the operational and computational performance of the proposed models and a stochastic programming model, demonstrating when significant performance improvements could be gained, and derive insights into the MFRSP. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.1153 .