An Improved CPU Time in Triangle Splitting Method for Solving a Biobjective Mixed Integer Program

In this paper, an existing algorithm known as Triangle Splitting Method (TSM) for the Bi-Objective Mixed Integer Program (BOMIP) has been modified, which has been named “An Improved Triangle Splitting Method (ITSM)”. The TSM solves many unnecessary single objectives Mixed Integer Programs (MIP) to s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of mathematical, engineering and management sciences Ročník 3; číslo 4; s. 351 - 364
Hlavní autoři: Al-Hasani, Ali, Al-Rabeeah, Al-Rabeeah, Kumar, Santosh, Eberhard, Andrew
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dehradun International Journal of Mathematical, Engineering and Management Sciences 01.12.2018
Ram Arti Publishers
Témata:
Algorithms
Biobjective mixed integer programming
Engineering
Exact algorithm for multi-objective optimization
Integer programming
Mathematics
Nondominated frontiers
Australia
Iraq
Melbourne Victoria Australia
ISSN:2455-7749, 2455-7749
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, an existing algorithm known as Triangle Splitting Method (TSM) for the Bi-Objective Mixed Integer Program (BOMIP) has been modified, which has been named “An Improved Triangle Splitting Method (ITSM)”. The TSM solves many unnecessary single objectives Mixed Integer Programs (MIP) to split each triangle with two rectangles, and second, it doesn’t find the all efficient frontiers. The proposed ITSM has resulted in redaction of CPU time by solving one MIP at each triangle and finds more number of nondominated frontiers compared to the TSM. The proposed modification has been tested in many instances.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2455-7749
2455-7749
DOI:10.33889/IJMEMS.2018.3.4-025