Authors: Stanojević, Milan
Stanojević, Bogdana 
Affiliations: Computer Science 
Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: An algorithm based on Branch-and-Bound method for finding all non-dominated points of MOCO problem
First page: 689
Last page: 694
Conference: XLVIII International Symposium on Operational Research, SYM-OP-IS 2021, Banja Koviljača, 20-23. septembar 2021.
Issue Date: 2021
Rank: M33
ISBN: 978-86-7589-151-2
In this paper we introduce a novel algorithm for finding all non-dominated points of MOCO problems.
Likewise a branch and bound method, our algorithm splits the feasible set in certain smaller sub-sets, and then performs the optimization of an aggregation of the original objective functions over each sub-set. However, the defined sub-sets are non-disjunctive, and in order to reduce the computational complexity, our implementation memorizes two lists of bounds: one containing those bounds that were found infeasible, and another containing the bounds that were successfully used in previous optimization steps. We report our numerical results obtained by solving multiple objective knapsack problems from a benchmark found in the literature.
Keywords: Multiple Objective Combinatorial Optimization | Branch and Bound | Hybrid Method
Publisher: University of Belgrade, Faculty of Mathematics

Show full item record

Page view(s)

checked on May 9, 2024

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.