Enhancement on the Improved Recursive Method for Multi-objective Integer Programming Problem
Abstract: In this paper, we have achieved further enhancement to the improved recursive method which ﬁnds the set of non-dominated solution for a multi-objective integer programming problem. A sum of two objectives is considered as one weighted sum objective for each iteration. Computational results support that the proposed approach outperformed the currently available results obtained by the improved recursive method with respect to CPU time and number of integer problem solved to identify all non-dominated points. Many problems like assignment, knapsack and travelling salesman have been investigated on diﬀerent size problems. The beneﬁt of this approach becomes more visible with the increase in the number of objective functions.
Keywords: Combinatorial optimization, Multi- objective integer programming, The improved recursive method, Non-dominated solution.
Category 1: Applications -- OR and Management Sciences
Category 2: Integer Programming
Citation: This paper has been submitted to "Arabian Journal for Science and Engineering" on 12/Sep/2018.
Entry Submitted: 11/28/2018
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|