Alvaro Sierra Altamiranda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alvaro Sierra Altamiranda has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hadi Charkhgard
University of South Florida
3 shared publications - Ali Eshragh
School of Information and Physical Sciences University of Newcastle NSW Australia
1 shared publication - Iman Dayarian
Culverhouse College of Business, University of Alabama, Tuscaloosa, Alabama 35487
1 shared publication - Sorna Javadi
Department of Industrial and Management Systems Engineering University of South Florida 33620 Tampa FL USA
1 shared publication
Latest Publications
- 1 October 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 31 (4) , 823-840
A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
We present the first (criterion space search) algorithm for optimizing a linear function over the set of efficient solutions of biobjective mixed integer linear programs. The proposed algorithm is developed based on the triangle splitting method [Boland N, Charkhgard H, Savelsbergh M (2015) A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method. INFORMS J. Comput. 27(4):597–618.], which can find a full representation of the nondominated frontier of any biobjective mixed integer linear program. The proposed algorithm is easy to implement and converges quickly to an optimal solution. An extensive computational study shows the efficacy of the algorithm. We numerically show that the proposed algorithm can be used to quickly generate a provably high-quality approximate solution because it maintains a lower and an upper bound on the optimal value of the linear function at any point in time.
- 1 October 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 31 (4) , 823-840
A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
We present the first (criterion space search) algorithm for optimizing a linear function over the set of efficient solutions of biobjective mixed integer linear programs. The proposed algorithm is developed based on the triangle splitting method [Boland N, Charkhgard H, Savelsbergh M (2015) A criterion space search algorithm for biobjective mixed integer programming: The triangle splitting method. INFORMS J. Comput. 27(4):597–618.], which can find a full representation of the nondominated frontier of any biobjective mixed integer linear program. The proposed algorithm is easy to implement and converges quickly to an optimal solution. An extensive computational study shows the efficacy of the algorithm. We numerically show that the proposed algorithm can be used to quickly generate a provably high-quality approximate solution because it maintains a lower and an upper bound on the optimal value of the linear function at any point in time.
- 28 June 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 27 (2) , 945-957
OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming
We present OOESAlgorithm.jl, a package for optimizing a linear function over the efficient set of biobjective mixed integer linear programs. The proposed package extends our recent study (see Sierra‐Altamiranda and Charkhgard [INFORMS Journal on Computing, https://doi.org/10.1287/ijoc.2018.0851]) by adding two main features: (a) in addition to CPLEX, the package allows employing any single‐objective solver supported by MathProgBase.jl, for example, GLPK, CPLEX, and SCIP; (b) the package supports execution on multiple processors and is compatible with the JuMP modeling language. An extensive computational study shows the efficacy of the package and its features.
- 28 June 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 27 (2) , 945-957
OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming
We present OOESAlgorithm.jl, a package for optimizing a linear function over the efficient set of biobjective mixed integer linear programs. The proposed package extends our recent study (see Sierra‐Altamiranda and Charkhgard [INFORMS Journal on Computing, https://doi.org/10.1287/ijoc.2018.0851]) by adding two main features: (a) in addition to CPLEX, the package allows employing any single‐objective solver supported by MathProgBase.jl, for example, GLPK, CPLEX, and SCIP; (b) the package supports execution on multiple processors and is compatible with the JuMP modeling language. An extensive computational study shows the efficacy of the package and its features.
- 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.