Application and assessment of divide-and-conquer-based heuristic algorithms for some integer optimization problems

Abstract

In this paper three heuristic algorithms using the Divide-and-Conquer paradigm are developed and assessed for three integer optimizations problems: Multidimensional Knapsack Problem (d-KP), Bin Packing Problem (BPP) and Travelling Salesman Problem (TSP). For each case, the algorithm is introduced, together with the design of numerical experiments, in order to empirically establish its performance from both points of view: its computational time and its numerical accuracy.

Keywords

• divide-and-conquer method
• multidimensional knapsack problem
• bin packing problem
• traveling salesman problem
• monte carlo simulations
• method’s efficiency