Sorna Javadi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sorna Javadi has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Ali Eshragh
School of Information and Physical Sciences University of Newcastle NSW Australia
1 shared publication - Alvaro Sierra Altamiranda
Department of Industrial and Management Systems Engineering, University of South Florida, Tampa, Florida 33620
1 shared publication - Hadi Charkhgard
University of South Florida
1 shared publication - Iman Dayarian
Culverhouse College of Business, University of Alabama, Tuscaloosa, Alabama 35487
1 shared publication
Latest Publications
- Open Access
Learning to Project in Multi-Objective Binary Linear Programming
In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion space search algorithms, the so-called KSA, during our study. This algorithm computes all nondominated points of a problem with p objectives by searching on a projected criterion space, i.e., a (p-1)-dimensional criterion apace. We present an effective and fast learning approach to identify on which projected space the KSA should work. We also present several generic features/variables that can be used in machine learning techniques for identifying the best projected space. Finally, we present an effective bi-objective optimization based heuristic for selecting the best subset of the features to overcome the issue of overfitting in learning. Through an extensive computational study over 2000 instances of tri-objective Knapsack and Assignment problems, we demonstrate that an improvement of up to 12% in time can be achieved by the proposed learning method compared to a random selection of the projected space.
Open AccessLearning to Project in Multi-Objective Binary Linear Programming
In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion space search algorithms, the so-called KSA, during our study. This algorithm computes all nondominated points of a problem with p objectives by searching on a projected criterion space, i.e., a (p-1)-dimensional criterion apace. We present an effective and fast learning approach to identify on which projected space the KSA should work. We also present several generic features/variables that can be used in machine learning techniques for identifying the best projected space. Finally, we present an effective bi-objective optimization based heuristic for selecting the best subset of the features to overcome the issue of overfitting in learning. Through an extensive computational study over 2000 instances of tri-objective Knapsack and Assignment problems, we demonstrate that an improvement of up to 12% in time can be achieved by the proposed learning method compared to a random selection of the projected space.