One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm?
Khushbu Patel, Mahesh Panchal
Journal Title:International Journal of Computer Science and Mobile Computing - IJCSMC
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.