A new variable neighborhood search approach for solving dynamic memory allocation problem

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. [Project of the Serbian Ministry of Education, Science and Technological Development, Grant no. 174010 and Grant no. TR36006]

Keywords

• dynamic memory allocation problem
• combinatorial optimization
• metaheuristics
• variable neighborhood search