83 research outputs found
Multi-objective integer programming: An improved recursive algorithm
This paper introduces an improved recursive algorithm to generate the set of
all nondominated objective vectors for the Multi-Objective Integer Programming
(MOIP) problem. We significantly improve the earlier recursive algorithm of
\"Ozlen and Azizo\u{g}lu by using the set of already solved subproblems and
their solutions to avoid solving a large number of IPs. A numerical example is
presented to explain the workings of the algorithm, and we conduct a series of
computational experiments to show the savings that can be obtained. As our
experiments show, the improvement becomes more significant as the problems grow
larger in terms of the number of objectives.Comment: 11 pages, 6 tables; v2: added more details and a computational stud
Optimising a nonlinear utility function in multi-objective integer programming
In this paper we develop an algorithm to optimise a nonlinear utility
function of multiple objectives over the integer efficient set. Our approach is
based on identifying and updating bounds on the individual objectives as well
as the optimal utility value. This is done using already known solutions,
linear programming relaxations, utility function inversion, and integer
programming. We develop a general optimisation algorithm for use with k
objectives, and we illustrate our approach using a tri-objective integer
programming problem.Comment: 11 pages, 2 tables; v3: minor revisions, to appear in Journal of
Global Optimizatio
Disjunctive programming for multiobjective discrete optimisation
In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a disjunction formed by a set of systems. The proposed approach lends itself to a simple yet effective iterative algorithm that is able to yield the set of all nondominated points, both supported and nonsupported, for a multiobjective discrete optimisation problem. Each iteration of the algorithm is a series of feasibility checks and requires only one formulation to be solved to optimality that has the same number of integer variables as that of the single objective formulation of the problem. The application of the algorithm show that it is particularly effective, and superior to the state-of-the-art, when solving constrained multiobjective discrete optimisation problem instances
Effective anytime algorithm for multiobjective combinatorial optimization problems
In multiobjective optimization, the result of an optimization algorithm is a set of efficient solutions from which the decision maker selects one. It is common that not all the efficient solutions can be computed in a short time and the search algorithm has to be stopped prematurely to analyze the solutions found so far. A set of efficient solutions that are well-spread in the objective space is preferred to provide the decision maker with a great variety of solutions. However, just a few exact algorithms in the literature exist with the ability to provide such a well-spread set of solutions at any moment: we call them anytime algorithms. We propose a new exact anytime algorithm for multiobjective combinatorial optimization combining three novel ideas to enhance the anytime behavior. We compare the proposed algorithm with those in the state-of-the-art for anytime multiobjective combinatorial optimization using a set of 480 instances from different well-known benchmarks and four different performance measures: the overall non-dominated vector generation ratio, the hypervolume, the general spread and the additive epsilon indicator. A comprehensive experimental study reveals that our proposal outperforms the previous algorithms in most of the instances.This research has been partially funded by the Spanish Ministry of Economy and Competitiveness (MINECO) and the European Regional Development Fund (FEDER) under contract TIN2017-88213-R (6city project), the European Research Council under contract H2020-ICT-2019-3 (TAILOR project), the University of Málaga, Consejería de Economía y Conocimiento de la Junta de Andalucía and FEDER under contract UMA18-FEDERJA-003 (PRECOG project), the Ministry of Science, Innovation and Universities and FEDER under contract RTC-2017-6714-5, and the University of Málaga under contract PPIT.UMA.B1.2017/07 (EXHAURO Project)
An outer approximation algorithm for multi-objective mixed-integer linear and non-linear programming
In this paper, we present the first outer approximation algorithm for
multi-objective mixed-integer linear programming problems with any number of
objectives. The algorithm also works for certain classes of non-linear
programming problems. It produces the non-dominated extreme points as well as
the facets of the convex hull of these points. The algorithm relies on an
oracle which solves single-objective weighted-sum problems and we show that the
required number of oracle calls is polynomial in the number of facets of the
convex hull of the non-dominated extreme points in the case of multiobjective
mixed-integer programming (MOMILP). Thus, for MOMILP problems for which the
weighted-sum problem is solvable in polynomial time, the facets can be computed
with incremental-polynomial delay. From a practical perspective, the algorithm
starts from a valid lower bound set for the non-dominated extreme points and
iteratively improves it. Therefore it can be used in multi-objective
branch-and-bound algorithms and still provide a valid bound set at any stage,
even if interrupted before converging. Moreover, the oracle produces Pareto
optimal solutions, which makes the algorithm also attractive from the primal
side in a multi-objective branch-and-bound context. Finally, the oracle can
also be called with any relaxation of the primal problem, and the obtained
points and facets still provide a valid lower bound set. A computational study
on a set of benchmark instances from the literature and new non-linear
multi-objective instances is provided.Comment: 21 page
Disjunctive Programming for Multiobjective Discrete Optimisation
In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a disjunction formed by a set of systems. The proposed approach lends itself to a simple yet effective iterative algorithm that is able to yield the set of all nondominated points, both supported and nonsupported, for a multiobjective discrete optimisation problem. Each iteration of the algorithm is a series of feasibility checks and requires only one formulation to be solved to optimality that has the same number of integer variables as that of the single objective formulation of the problem. The application of the algorithm show that it is particularly effective, and superior to the state-of-the-art, when solving constrained multiobjective discrete optimisation problem instances
Output-sensitive complexity of multiobjective combinatorial optimization
We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general enumeration problem is regarded efficient if it is output-sensitive, i.e., its running time is bounded by a polynomial in the input and the output size. We provide both practical examples of MOCO problems for which such an efficient algorithm exists as well as problems for which no efficient algorithm exists under mild complexity theoretic assumptions
Relaxations and Duality for Multiobjective Integer Programming
Multiobjective integer programs (MOIPs) simultaneously optimize multiple
objective functions over a set of linear constraints and integer variables. In
this paper, we present continuous, convex hull and Lagrangian relaxations for
MOIPs and examine the relationship among them. The convex hull relaxation is
tight at supported solutions, i.e., those that can be derived via a
weighted-sum scalarization of the MOIP. At unsupported solutions, the convex
hull relaxation is not tight and a Lagrangian relaxation may provide a tighter
bound. Using the Lagrangian relaxation, we define a Lagrangian dual of an MOIP
that satisfies weak duality and is strong at supported solutions under certain
conditions on the primal feasible region. We include a numerical experiment to
illustrate that bound sets obtained via Lagrangian duality may yield tighter
bounds than those from a convex hull relaxation. Subsequently, we generalize
the integer programming value function to MOIPs and use its properties to
motivate a set-valued superadditive dual that is strong at supported solutions.
We also define a simpler vector-valued superadditive dual that exhibits weak
duality but is strongly dual if and only if the primal has a unique
nondominated point
Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems
Convex approximation sets for multiobjective optimization problems are a
well-studied relaxation of the common notion of approximation sets. Instead of
approximating each image of a feasible solution by the image of some solution
in the approximation set up to a multiplicative factor in each component, a
convex approximation set only requires this multiplicative approximation to be
achieved by some convex combination of finitely many images of solutions in the
set. This makes convex approximation sets efficiently computable for a wide
range of multiobjective problems - even for many problems for which (classic)
approximations sets are hard to compute.
In this article, we propose a polynomial-time algorithm to compute convex
approximation sets that builds upon an exact or approximate algorithm for the
weighted sum scalarization and is, therefore, applicable to a large variety of
multiobjective optimization problems. The provided convex approximation quality
is arbitrarily close to the approximation quality of the underlying algorithm
for the weighted sum scalarization. In essence, our algorithm can be
interpreted as an approximate variant of the dual variant of Benson's Outer
Approximation Algorithm. Thus, in contrast to existing convex approximation
algorithms from the literature, information on solutions obtained during the
approximation process is utilized to significantly reduce both the practical
running time and the cardinality of the returned solution sets while still
guaranteeing the same worst-case approximation quality. We underpin these
advantages by the first comparison of all existing convex approximation
algorithms on several instances of the triobjective knapsack problem and the
triobjective symmetric metric traveling salesman problem
- …