A new Variable Neighborhood Search approach for solving Dynamic Memory Allocation Problem
A new VNS approach for solving DMAP
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.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.