A Hybrid Genetic Algorithm for the One-Dimensional Minimax Bin-Packing Problem with Assignment Constraints
暂无分享,去创建一个
[1] Goldberg,et al. Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.
[2] Jordi Pereira,et al. Variable neighborhood search heuristics for a test assembly design problem , 2015, Expert Syst. Appl..
[3] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[4] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[5] Michael J. Brusco,et al. Exact and approximate methods for a one-dimensional minimax bin-packing problem , 2013, Ann. Oper. Res..
[6] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[7] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[8] El-Ghazali Talbi,et al. A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.