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

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

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 compa...

Full description

Bibliographic Details
Main Authors: Ivanović Marija, Savić Aleksandar, Urošević Dragan, Dugošija Đorđe
Format: Article
Language:English
Published: University of Belgrade 2018-01-01
Series:Yugoslav Journal of Operations Research
Subjects:
dynamic memory allocation problem
combinatorial optimization
metaheuristics
variable neighborhood search
Online Access:http://www.doiserbia.nb.rs/img/doi/0354-0243/2018/0354-02431800018I.pdf

Internet

http://www.doiserbia.nb.rs/img/doi/0354-0243/2018/0354-02431800018I.pdf

Similar Items