Application and Assessment of Divide-and-Conquer-Based Heuristic Algorithms for Some Integer Optimization Problems

  • Fernando Alberto Morales Universidad Nacional de Colombia, Sede Medellín, Colombia

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.

Author Biography

Fernando Alberto Morales, Universidad Nacional de Colombia, Sede Medellín, Colombia

I am an Associate Professor at Universidad Nacional de Colombia, Sede Medellín and have a PhD in Mathematics. Although my initial training was in Partial Differential Equations, my research interest in the latest years is in Discrete Mathematics, Combinatorics as well as Linear and Integer Programming.

Published
2022-11-27
How to Cite
MORALES, Fernando Alberto. Application and Assessment of Divide-and-Conquer-Based Heuristic Algorithms for Some Integer Optimization Problems. Yugoslav Journal of Operations Research, [S.l.], v. 33, n. 3, p. 341-366, nov. 2022. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/1046>. Date accessed: 04 dec. 2024. doi: https://doi.org/10.2298/YJOR2111015030M.
Section
Research Articles

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.