Yash Aneja Bio

picture of yash aneja

Yash Aneja, Ph.D.
Professor and Area Chair, Management Science
aneja@uwindsor.ca
519-253-3000 ext. 3110
Office: OB 408

Education 

  • Ph.D.  Johns Hopkins, Baltimore, Maryland, Operations Research, 1974.
  • M.A.  Indian Statistical Institute, Calcutta, India, Statistics, 1967.
  • GD  Indian Statistical Institute, Calcutta, India, Diploma in Computer Science, 1967.
  • B.A.  Indian Statistical Institute, Calcutta, India, Statistics, 1966.

Selected Publications  

  • Shiva, J., Li, X., Aneja, Y., & Li, X. (2023).  Ride-matching for the ride-hailing platform with heteogeneous drivers.   Transport Policy, 136, 169-192, https://doi.org/10.1016/j.tranpol.2023.04.001.136, 169-192. [April]
  • Li, X., Li, X., Wang, H., Shi, J., & Aneja, Y. (2022).  Supply regulation under the exclusion policy in a ride-sourcing market.   Transportation Research Part B: Methodological, 166, 69-94, http://doi.org/10.1016/j.trb.2022.10.005 [October]
  • Jiang, D.; Li, X., Aneja, Y., Wang, W. & Tian, P. (2022). Integrating order delivery and return operations for order fulfillment in an online retail environment. Computers & Operations Research, 143, http://doi.org/10.1016/j.cor.2022.105749. [March]
  • Agarwal, Y. K.; Aneja, Y. & Jayaswal, S. (2021).  Directed fixed charge multicommodity network design: A cutting plane approach using polar duality.  European Journal of Operational Research, http://doi.org/10.1016/j.ejor.2021.08.043. [September]
  • Li, X., & Aneja, Y. (2020).  A new branch-and-cut approach for the generalized regenerator problem.   Annals of Operations Research, 295, 229-255, http://doi.org/10.1007/s10479-020-03721-6. [July]
  • Li, X., Ding, Y., Pan, K., Jiang, D., & Aneja, Y. (2020).  Single-path service network design problem with resource constraints.   Transportation Research Part E: Logistics and Transportation Review, 140, 1-27, http://doi.org/10.1016/j.tre.2020.101945. [August]
  • Rahman, Md. Z., Mukhopadhyay, A., & Aneja, Y. (2020).  A separator-based method for generating weakly chordal graphs.   Discrete Mathematics, Algorithms and Applications, 12 (4), http://doi.org/10.1142/S1793830920500391.
  • Li, X., Wei, K., Guo, Z., Wang, W., & Aneja, Y. (2020).  An exact approach for the service network design problem with heterogeneous resource constraints.   Omega: the International Journal of Management Science, http://doi.org/10.1016/j.omega.2020.102376.  [November]
  • Li, X., Li, J., Aneja, Y. P., Guo, Z., & Tian, P. (2019).  Integrated order allocation and order routing problem for e-order fulfillment.   IISE Transactions: industrial engineering research and development (until 2016: IIE Transactions 0704-817X), 51 (10), 1129-1150, http://doi.org/10.1080/24725854.2018.1552820.  [April]
  • Li, X., & Aneja, Y. (2019).  A branch-and-benders-cut approach for the fault tolerant regenerator location problem.   Computers & Operations Research, http://doi.org/10.1016/j.cor.2019.104847.  [November]
  • Li, X., Yue, C., Aneja, Y. P., Chen, S., & Cui, Y. (2018).  An iterated tabu search metaheuristic for the regenerator location problem.   Applied Soft Computing, 70, 182-194, http://doi.org/10.1016/j.asoc.2018.05.019.  [September]

Complete Curriculum Vitae