ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm?

Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 2)

Publication Date:

Authors : ;

Page : 761-766

Keywords : One-dimension Multi-Objective Bin Packing Problem (ODMOBPP); Memetic Algorithm; Local Search; Optimization problems;

Source : Downloadexternal Find it from : Google Scholarexternal


Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In this paper memetic algorithm is performing local search on each chromosome; it is guaranteed to give near to optimal solution than Genetic Algorithm.

Last modified: 2014-03-03 21:24:18