Bi-objective integer programming analysis based on the characteristic equation

In this paper, a bi-objective integer programming problem is analysed using the characteristic equation that was developed to solve a single-objective pure integer program. This equation can also provides other ranked solutions i.e. 2nd, 3rd,... best solutions. These solutions are potential non-domi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of system assurance engineering and management Ročník 10; číslo 5; s. 937 - 944
Hlavní autoři: Al-Rabeeah, Masar, Kumar, Santosh, Al-Hasani, Ali, Munapo, Elias, Eberhard, Andrew
Médium: Journal Article
Jazyk:angličtina
Vydáno: New Delhi Springer India 01.10.2019
Springer Nature B.V
Témata:
Algorithms
Eigenvalues
Eigenvectors
Engineering
Engineering Economics
Integer programming
Integers
Logistics
Marketing
Mathematical programming
Organization
Original Article
Quality Control
Reliability
Safety and Risk
Non-dominated points
Characteristic equation
Bi-objective integer program
Pure integer program
ISSN:0975-6809, 0976-4348
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, a bi-objective integer programming problem is analysed using the characteristic equation that was developed to solve a single-objective pure integer program. This equation can also provides other ranked solutions i.e. 2nd, 3rd,... best solutions. These solutions are potential non-dominated points for a bi-objective integer program, which is being investigated in this paper. A “ C ” code is developed to solve the characteristic equation, a tool which is not available in the IBM ILOG CPLEX library. Two versions of this algorithm are developed to identify the non-dominated points for the bi-objective integer programming problem. The second version improves on the first by reducing the number of search steps. Computational experiments are carried out with respect to the two algorithms developed in this paper and comparisons have also been carried out with one of the recently developed method, the balanced box method. These computational experiments indicate that the second version of the algorithm developed in this paper performed significantly better than the first version and out performed the balanced box method with respect to both CPU time and the number of iterations.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0975-6809
0976-4348
DOI:10.1007/s13198-019-00824-7