Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/794| Title: | A new variable neighborhood search approach for solving dynamic memory allocation problem | Authors: | Ivanović, Marija Savić, Aleksandar Urošsević, Dragan Dugošija, Djordje |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Combinatorial optimization;Dynamic memory allocation problem;Metaheuristics;Variable neighborhood search | Issue Date: | 13-Sep-2018 | Journal: | Yugoslav Journal of Operations Research | Abstract: | This paper is devoted to the Dynamic Memory Allocation Problem (DMAP) in embedded systems. The existing Integer Linear Programing (ILP) formulation for DMAP is improved, and given that there are several metaheuristic approaches for solving the DMAP, a new metaheuristic approach is proposed and compared with the former ones. Computational results show that our new heuristic approach outperforms the best algorithm found in the literature regarding quality and running times. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/794 | ISSN: | 03540243 | DOI: | 10.2298/YJOR161015018I |
| Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.