Alexander Vinel

Dr. Alexander Vinel

orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
18 February 2020 in Sensors
Verified
Journal Article
Open access
PDF file
AMAmir Mehdizadeh
Amir Mehdizadeh
MCMiao Cai
Miao Cai
QHQIONG HU
QIONG HU
MYMohammad Ali Alamdar Yazdi
Mohammad Ali Alamdar Yazdi
NKNasrin Mohabbati Kalejahi
Nasrin Mohabbati Kalejahi
FMFadel Megahed
Fadel Megahed
This part of the review aims to reduce the start-up burden of data collection and descriptive analytics for statistical modeling and route optimization of risk associated with motor vehicles. From a data-driven bibliometric analysis, we show that the literature is divided into two disparate research streams: (a) predictive or explanatory models that attempt to understand and quantify crash risk based on different driving conditions, and (b) optimization techniques that focus on minimizing crash risk through route/path-selection and rest-break scheduling. Translation of research outcomes between these two streams is limited. To overcome this issue, we present publicly available high-quality data sources (different study designs, outcome variables, and predictor variables) and descriptive analytic techniques (data summarization, visualization, and dimension reduction) that can be used to achieve safer-routing and provide code to facilitate data collection/exploration by practitioners/researchers. Then, we review the statistical and machine learning models used for crash risk modeling. We show that (near) real-time crash risk is rarely considered, which might explain why the optimization models (reviewed in Part 2) have not capitalized on the research outcomes from the first stream.

3 February 2020 in Ergonomics
Verified
Journal Article
Closed access
AMAmir Mehdizadeh
Amir Mehdizadeh
AVAlexander Vinel
Alexander Vinel
QHQIONG HU
QIONG HU
MSMark Schall
Mark Schall
SGSean Gallagher
Sean Gallagher
RSRichard F. Sesek
Richard F. Sesek
Job rotation is an organizational strategy that can be used, in part, to reduce occupational exposure to physical risk factors associated with work-related musculoskeletal disorders (MSDs). Recent studies, however, suggest that job rotation schedules may increase the overall risk of injury to workers included in the rotation scheme. We describe a novel optimization framework evaluating the effectiveness of a job rotation scheme using the fatigue failure model of MSD development and a case study with real injury data. Results suggest that the effect of job rotation is highly-dependent on the composition of the job pool, and inclusion of jobs with higher risk results in a drastic decrease in the effectiveness of rotation for reducing overall worker risk. The study highlights that in cases when high-risk jobs are present, job redesign of those high risk tasks should be the primary focus of intervention efforts rather than job rotation. Practitioner Summary: Job rotation is often used in industry as a method to “balance” physical demands experienced by workers to reduce musculoskeletal disorder (MSD) risk. This article examines the efficacy of reducing MSDs through job rotation using numerical simulation of job rotation strategies and utilizing the fatigue failure model of MSD development.

1 May 2019 in Applied Energy
Verified
Journal Article
Closed access
EMEbrahim Mortaz
Ebrahim Mortaz
AVAlexander Vinel
Alexander Vinel
YDYury Dvorkin
Yury Dvorkin


12 February 2014 in Optimization Methods and Software
Verified
Journal Article
Closed access
AVAlexander Vinel
Alexander Vinel
PKPavlo A. Krokhmal
Pavlo A. Krokhmal
This paper discusses the use of polyhedral approximations in solving p-order cone programming (pOCP) problems, or linear problems with p-order cone constraints, and their mixed-integer extensions. In particular, it is shown that the cutting-plane technique proposed in Krokhmal and Soberanis [Risk optimization with p-order conic constraints: A linear programming approach, Eur. J. Oper. Res. 201 (2010), pp. 653–671, http://dx.doi.org/10.1016/j.ejor.2009.03.053] for a special type of polyhedral approximations of pOCP problems, which allows for generation of cuts in constant time not dependent on the accuracy of approximation, is applicable to a larger family of polyhedral approximations. We also show that it can further be extended to form an exact solution method for pOCP problems with O(ϵ−1) iteration complexity. Moreover, it is demonstrated that an analogous constant-time cut-generating algorithm exists for recursively constructed lifted polyhedral approximations of second-order cones due to Ben-Tal and Nemirovski [On polyhedral approximations of the second-order cone, Math. Oper. Res. 26 (2001), pp. 193–205. Available at http://dx.doi.org/10.1287/moor.26.2.193.10561]. It is also shown that the developed polyhedral approximations and the corresponding cutting-plane solution methods can be efficiently used for obtaining exact solutions of mixed-integer pOCP problems.

28 February 2022 in Structural and Multidisciplinary Optimization
Verified
Journal Article
Closed access
PDF file
Oguz ToragayOguz Toragay
Oguz Toragay
DSDaniel F. Silva
Daniel F. Silva
AVAlexander Vinel
Alexander Vinel
NSNima Shamsaei
Nima Shamsaei