.png){kind=icon}
.png){kind=icon}
Return
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-019-03317-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an exact scalarization method to solve bi-objective integer linear optimization problems. This method uses diverse reference points in the iterations, and it is free from any kind of a priori chosen weighting factors. In addition, two new adapted scalarization methods from literature and the modified Tchebycheff method are studied. Each one of them results in different ways to obtain the Pareto frontier. Computational experiments were performed with random real size instances of two special problems related to the manufacturing industry, which involve lot sizing and cutting stock problems. Extensive tests confirmed the very good performance of the new scalarization method with respect to the computational effort, the number of achieved solutions, the ability to achieve different solutions, and the spreading and spacing of solutions at the Pareto frontier.
Keywords:
Bi-objective optimization problems
Integer linear optimization
Exact scalarization methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
View more organizations