Applying Gene Expression Programming for Solving One-Dimensional Bin-Packing Problems
This work aims to study and explore the use of Gene Expression Programming (GEP) in solving the on-line Bin-Packing problem. The main idea is to show how GEP can automatically find acceptable heuristic rules to solve the problem efficiently and economically. One dimensional Bin-Packing problem is considered in the course of this work with the constraint of minimizing the number of bins filled with the given pieces. Experimental Data includes instances of benchmark test data taken from Falkenauer (1996) for One-dimensional Bin-Packing Problems. Results show that GEP can be used as a very powerful and flexible tool for finding interesting compact rules suited for the problem. The impact of functions is also investigated to show how they can affect and influence the success of rates when they appear in rules. High success rates are gained with smaller population size and fewer generations compared to previous work performed using Genetic Programming.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multi Expression Programming
Multi Expression Programming (MEP) is a new evolutionary paradigm intended for solving computationally difficult problems. MEP individuals are linear entities that encode complex computer programs. MEP chromosomes are re…
regressionSymbolic RegressionMulti Expression Programming for solving classification problems
Multi Expression Programming (MEP) is a Genetic Programming variant which encodes multiple solutions in a single chromosome. This paper introduces and deeply describes several strategies for solving binary and multi-clas…
ClassificationMulti-class ClassificationCellular reprogramming dynamics follow a simple one-dimensional reaction coordinate
Cellular reprogramming, the conversion of one cell type to another, has fundamentally transformed our conception of cell types. Cellular reprogramming induces global changes in gene expression involving hundreds of trans…
Time SeriesTime Series Analysisjsdp: a Java Stochastic DP Library
Stochastic Programming is a framework for modelling and solving problems of decision making under uncertainty. Stochastic Dynamic Programming is a branch of Stochastic Programming that takes a "functional equation" appro…
Decision MakingDecision Making Under UncertaintyEvolving TSP heuristics using Multi Expression Programming
Multi Expression Programming (MEP) is an evolutionary technique that may be used for solving computationally difficult problems. MEP uses a linear solution representation. Each MEP individual is a string encoding complex…
Traveling Salesman Problem