Combining Development and Evolution - Case Study: One Dimensional Bin-packing

Christopher Rajah, Nelishia Pillay

2015

Abstract

The literature highlights the effectiveness of emulating processes from nature to solve complex optimization problems. Two processes in particular that have been investigated are evolution and development. Evolution is achieved by genetic algorithms and the developmental approach was introduced to achieve development. The developmental approach differs from other metaheuristics in that it does not explore the search space applying intensification and diversification to a complete candidate solution. Instead intensification and diversification are performed incrementally, at each step in the process of creating a solution. This is based on an analogy from nature in which a multicellular organism is created incrementally rather than firstly being completely developed and then improved to be fitter. Evolution on the other hand is used to explore the space by applying intensification and diversification to randomly created candidate solutions with the aim of improving the fitness of these candidate solutions and ultimately producing a solution to the problem. Given that in nature once an organism is initially developed its development or growth does not stop at that point but certain cells may continue to grow until a certain point in an organism’s life span, it was felt that the developmental approach terminated prematurely. It was hypothesized that a combination of both these processes, instantiated with development and followed by evolution, would better emulate the processes in nature and would be more effective at exploring the search space. The objective of the research presented in the paper is to test this hypothesis. In terms of search this would mean combining a metaheuristic that applies intensification and diversification incrementally at each step on partial solutions to create initial candidate solutions which are then further explored by a metaheuristic that explores the space of complete candidate solutions. The one-dimensional bin-packing problem was used as a case study to evaluate these ideas. The hybridization of the developmental approach and genetic algorithm was found to perform better than each of these approaches applied separately to solve the problem instances. This study was an initial attempt to test the above hypothesis and has highlighted the potential of this hybridization. Given this future work will apply this approach to other combinatorial optimization problems.

References

  1. Banzhaf, W., Pillay, N., 2007. Why Complex Systems Engineering Needs Biological Development. Complexity, Vol. 13, No. 2, 12-21.
  2. Pillay, N., Banzhaf, N., 2008. A Developmental Approach to the Uncapacitated Examination Timetabling Problem. In Proceedings of PPSN 2008, Lecture Notes in Computer Science, 276-285.
  3. Pillay, N., 2009. A Revised Developmental Approach to the Uncapacitated Examination Timetabling Problem. In Proceedings of SAICSIT 2009, Gauteng,South Africa, ACM Press,187-192.
  4. Pillay, N., 2011. A Study of Noise Operators in the Developmental Approach for the Examination Timetabling Problem. In Proceedings of the 2011 IEEE Conference on Intelligent Computing and Intelligent Systems (ICIS 2011), Guangzhou, China, Vol. 3, 534- 538, IEEE Press, November 2011
  5. Rajah, C., Pillay, N. 2013. A Study of introduction of cell depletion in the Developmental Approach for the Uncapacitated Examination Timetabling Problem. In Proceedings of ORSSA 2013, 102-111.
  6. McCollum, B., McMullan, P., Paechter, B., Lewis, R., Schaerf, A., DiGapsero, L., Parkes, A. J., Qu, R., Burke, E.K., 2008. Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal of Computing, Vol. 22, No.1, 120-130.
  7. Ochoa, G., M. Hyde, T. Curtois, , July 2014 J.A. VazquezRodriguez, J. Walker, M. Gendreau, G. Kendall, B. McCollum, A. J. Parkes, S. Petrovic andE.K. Burke."HyFlex: A Benchmark Framework for CrossDomain Heuristic Search". In Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2012), Lecture Notes in Computer Science, Vol. 7245, pp. 136-147, 2012.
  8. Blum, C., Roli, A. 2013. Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys, vol. 35, no. 3, 268-308.
  9. Scholl, A., Klein, R., Jurgens, C., 1997. Bison: A Fast Hybrid Procedure for Exactly Solving the OneDimensional Bin Packing Problem. Computers and Operations Research, vol. 24, no. 7, 626-645.
  10. Flezar, K., Hindi, K. S., 2002. New Heuristics for OneDimensional Bin-Packing". Computers and Research, vol. 29, no. 7, 821-839.
  11. Layeb, A., Chenche, S., 2012. A Novel GRASP Algorithm for Solving the Bin-Packing Problem. International Journal of Information Engineering and Electronic Business, vol. 2, 8-14.
  12. Glover, F., Laguna, M. 1997. Tabu Search, Kluwer Academic Publishers.
  13. Layeb, A., Boussalia, S. R., 2012. A Novell Quantum Inspired Cuckoo Search Algorithm for Bin-Packing Problem. International Journal of Information Technology and Computer Science, vol. 5, pp. 58-67, 2012.
  14. Alvim, A. C., Ribeiro, C. C., Glover, F., Aloise, D. J., 2004. A Hybrid Improvement Heuristic for the OneDimensional Bin Packing Problem. Journal of heuristics, vol. 10, 205-229.
  15. Lima, H., Yakawa, T., 2003. A New Design Of Genetic Algorithm For Bin Packing. Evolutionary Computation , 2003, CEC 7803. The 2003 Congress on Evolutionary Computation, vol. 2, 1044-1049.
  16. Rohlfshagen, P., Bullinara, J. A. 2007. A Genetic Algorithm With Exon Shuffling Crossover for Hard Bin Packing Problems. In GECCO 7807 Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, New York, USA, 1365-1371.
  17. Abidi, S., Krichen, S., Alba, E., Molina, J. M., 2013. Improvement Heuristic for Solving the OneDimensional Bin-Packing Problem. In Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO), 1-5.
  18. Dokeroglu, T., Cosar, A., 2014. Optimization of OneDimensional Bin Packing Problem with Island Parallel Grouping Genetic Algorithms. Computers and Industrial Engineering, Vol. 75, 176-186.
  19. López-Camacho, E., Terashima-Marin, H., Ross, P., Ochoa, G., 2014. A Unified Hyper-Heuristic Framework for Solving Bin Packing Problems. Expert Systems with Applications, vol. 41, no. 15, 6876-6889.
  20. Falkenauer, E., 1996. A Hybrid Grouping Genetic Algorithm For Bin Packing. Journal of Heuristics, vol. 2, 5-30.
Download


Paper Citation


in Harvard Style

Rajah C. and Pillay N. (2015). Combining Development and Evolution - Case Study: One Dimensional Bin-packing . In Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA, ISBN 978-989-758-157-1, pages 188-195. DOI: 10.5220/0005592901880195


in Bibtex Style

@conference{ecta15,
author={Christopher Rajah and Nelishia Pillay},
title={Combining Development and Evolution - Case Study: One Dimensional Bin-packing},
booktitle={Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA,},
year={2015},
pages={188-195},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005592901880195},
isbn={978-989-758-157-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA,
TI - Combining Development and Evolution - Case Study: One Dimensional Bin-packing
SN - 978-989-758-157-1
AU - Rajah C.
AU - Pillay N.
PY - 2015
SP - 188
EP - 195
DO - 10.5220/0005592901880195