Xavier Gandibleux

Analysis and discussion of single and multi-objective IP formulations for the Truck-to-dock Door Assignment Problem

  • Xavier Gandibleux
  • Nicolas Forget
    • Categories Applications - OR and Management Sciences, Integer Programming, Multi-Criteria Optimization Tags , , , ,

    \(\) This paper is devoted to the Truck-to-dock Door Assignment Problem. Two integer programming formulations introduced after 2009 are examined. Our review of the literature takes note of the criticisms and limitations addressed to the seminal work of 2009. Although the published adjustments that followed present strong argument and technical background, we have identified several … Read more

    A primal heuristic to compute an upper bound set for multi-objective 0-1 linear optimisation problems

  • Xavier Gandibleux
  • Guillaume Gasnier
  • Said Hanafi
    • Categories Branch and Cut Algorithms, Integer Programming, Multi-Criteria Optimization

    This paper presents an algorithm aiming to compute an upper bound set for a multi-objective linear optimisation problem with binary variables (p-01LP). Inspired by the well known « Feasibility Pump » algorithm in single objective optimisation, it belongs to the class of primal heuristics. The proposed algorithm, named « Gravity Machine », aims to deal … Read more

    Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

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

    The paper deals with the definition and the computation of surrogate upper bound sets for the bi-objective bi-dimensional binary knapsack problem. It introduces the Optimal Convex Surrogate Upper Bound set, which is the tightest possible definition based on the convex relaxation of the surrogate relaxation. Two exact algorithms are proposed: an enumerative algorithm and its … Read more