A new Variable Neighborhood Search approach for solving Dynamic Memory Allocation Problem

A new VNS approach for solving DMAP

  • Marija Ivanovic Faculty of Mathematics, Belgrade, Serbia
  • Aleksandar Savić Faculty of Mathematics, Belgrade, Serbia
  • Dragan Urošević Mathematical Institute SANU, Belgrade, Serbia
  • Djordje Dugošija Faculty of Mathematics, Serbia, Belgrade

Abstract

This paper is devoted to the Dynamic Memory Allocation Problem (DMAP) in embedded systems.


Existing Integer Linear Programing (ILP) formulation for DMAP is improved and given that there are several metaheuristic approaches for solving the DMAP, a new metaheuristics approach is proposed and compared with the former ones.


Computational results shows that new metaheuristics approach, outperforms the best algorithm found in the literature in the sense of solutions’ quality and running times.

Published
2018-06-12
How to Cite
IVANOVIC, Marija et al. A new Variable Neighborhood Search approach for solving Dynamic Memory Allocation Problem. Yugoslav Journal of Operations Research, [S.l.], v. 28, n. 3, p. 291–314, june 2018. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/55>. Date accessed: 05 dec. 2024.
Citation Formats
Issue
Vol 28 No 3 (2018)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

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.