multi-objective combinatorial optimization

Paving and computing the set of nondominated points for the bi-objective 0/1 uncapacitated facility location problem

  • Xavier Gandibleux
  • Anthony Przybylski
    • Categories Combinatorial Optimization, Multi-Criteria Optimization Tags , , , , ,

    The paper presents a three-phase algorithm to compute the set of nondominated points for the binary version of the uncapacitated facility location problem with two objectives. The first phase constructs a paving in objective space which is a collection of boxes that covers all nondominated points. The paving procedure is a branch and bound algorithm … Read more

    A GRASP algorithm for the multi-objective knapsack problem

  • José Elias Arroyo
  • Dalessandro Vianna
    • Categories Meta Heuristics Tags ,

    In this article, we propose a Greedy Randomized Adaptive Search Procedure (GRASP) to generate a good approximation of the efficient or Pareto optimal set of a multi-objective combinatorial optimization problem. The algorithm is applied for the 0/1 knapsack problem with r objective functions. This problem is formulated as r classic 0/1 knapsack problems. n items, … Read more