Enhancement of the Improved Recursive Method for Multi-objective Integer Programming Problem

In this paper, we developed a new algorithm to find the set of a non-dominated points for a multi-objective integer programming problem. The algorithm is an enhancement on the improved recursive method where the authors have used a lexicographic method for analysis. In this approach a sum of two obj...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1490; číslo 1; s. 12061 - 12070
Hlavní autoři: Al-Rabeeah, Masar, Al-Hasani, Ali, Kumar, Santosh, Eberhard, Andrew
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.03.2020
Témata:
Algorithms
Combinatorial optimization
Integer programming
Iterative methods
Multi-objective integer programming
Non-dominated solution
Physics
Recursive methods
The improved recursive method
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we developed a new algorithm to find the set of a non-dominated points for a multi-objective integer programming problem. The algorithm is an enhancement on the improved recursive method where the authors have used a lexicographic method for analysis. In this approach a sum of two objectives is considered as one weighted sum objective for each iteration. Computational results show that the proposed approach outperforms the currently available results obtained by the improved recursive method with respect to CPU time and the number of integer problems solved to identify all non-dominated points. Many problems such as assignment, knapsack and travelling salesman have been investigated on different sized problems. The benefit of this approach becomes more visible with the increase in the number of objective functions.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1490/1/012061