A grouping genetic algorithm using linear linkage encoding for bin packing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5199 LNCS, Issue , 2008, Pages 1140-1149

  Ülker, Özgür ^a   Korkmaz, Emin Erkan ^a   Özcan, Ender ^a  

^a YEDITEPE UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS; CLUSTERING ALGORITHMS; DIESEL ENGINES; ENCODING (SYMBOLS); GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; BENCHMARKING;

BENCHMARK PROBLEMS; BIN PACKING PROBLEMS; BIN PACKINGS; CROSSOVER OPERATORS; DATA CLUSTERING; ENCODING SCHEMES; GENETIC OPERATORS; GRAPH COLORINGS; GROUPING GENETIC ALGORITHMS; GROUPING PROBLEMS; MULTI-OBJECTIVE GENETIC ALGORITHMS; RECOMBINATION OPERATORS; REPRESENTATION METHODS; TIMETABLING PROBLEMS;

PROBLEM SOLVING;

BENCHMARK-PROBLEM INSTANCES; BIN PACKING PROBLEM; CROSSOVER OPERATOR; GROUPING GENETIC ALGORITHMS; MULTI-OBJECTIVE GENETIC ALGORITHM; RECOMBINATION OPERATORS; REPRESENTATION METHOD; TIMETABLING PROBLEM;

EID: 56549120394     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87700-4_113     Document Type: Conference Paper

References (21)

1. Backofen, R., Will, S,: Excluding symmetries in constraint-based search. Principles and Practice of Constraint Programming, 73-87 (1999)
2. Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey., 46-93 (1997)
3. Crawford, J., Ginsberg, M.L., Luck, E., Roy, A.: Symmetry-breaking predicates for search problems. In: Aiello, L.C., Doyle, J., Shapiro, S. (eds.) KR. 1996: Principles of Knowledge Representation and Reasoning, pp. 148-159. Morgan Kaufmann, San Francisco (1996)
4. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
5. Dosa, G.: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD (I) ≤ 11/9 OPT (I). in: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 1-11. Springer, Heidelberg (2007)
6. Du, J., Korkmaz, E., Alhajj, R., Barker, K.: Novel clustering approach that employs genetic algorithm with new representation scheme and multiple objectives. In: Kambayashi, Y., Mohania, M., Wöß, W. (eds.) DaWaK 2004. LNCS, vol. 3181, Springer, Heidelberg (2004)
7. Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5-30 (1996)
8. Falkenauer, E,: Genetic Algorithms and Grouping Problems. John Wiley and Sons, Chichester (1998)
9. Falkenauer, E., Delchambre, A.: A genetic algorithm for bin packing and line balancing. In: Proc. of the IEEE 1992 Int. Conf. on Robotics and Automation, Nice, France, pp. 1186-1192 (1992)
10. Glover, F.: Tabu search, part 1. ORSA Journal on Computing 1, 190-206 (1989)
11. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
12. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)
13. Kirkpatrick, S., Gelatt, CD., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671-680 (1983)
14. Korkmaz, E.E., Du, J., Alhajj, R., Barker, K.: Combining advantages of new chromosome representation scheme and multi-objective genetic algorithms for better clustering. Intelligent Data Analysis 10(2), 163-182 (2006)
15. Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematic 28(1), 59-70 (1990)
16. Ozcan, E.: Memes, Self-generation and Nurse Postering. In: PATAT 2006. LNCS, vol. 3867, pp. 85-104. Springer, Heidelberg (2007)
17. Ozcan, E., Alkan, A.: A Memetic Algorithm for Solving a Timetabling Problem: An incremental Strategy, in: Baptiste, P., Kendall, G., Kordon, A.M., Sourd, F. (eds.) Proc. of the 3rd Multidisciplinary Int. Conf. On Scheduling: Theory and Applications, pp. 394-401 (2007)
18. Ozcan, E., Bilgin, B., Korkmaz, E.E.: A Comprehensive Analysis of Hyper-heuristics. Intelligent Data Analysis 12(1), 3-23 (2008)
19. Ozcan, E., Onbasioglu, E.: Memetic Algorithms for Parallel Code Optimization. International Journal of Parallel Programming 35(1), 33-61 (2007)
20. Radcliffe, N.J.: Formal analysis and random respectful recombination. In: Belew, R.K., Booker, L.B. (eds.) Proc. of the 4th Int. Conf. on GAs, pp. 222-229 (1991)
21. Ulker, O., Ozcan, E., Korkmaz, E.E.: Linear Linkage Encoding in Grouping Problems: Applications on Graph Coloring and Timetabling. In: Proc. of the 6th Int. Conf. on the Practice and Theory of Automated Timetabling, pp. 303-319 (2006)